./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/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_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 10:55:15,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:55:15,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:55:15,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:55:15,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:55:15,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:55:15,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:55:15,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:55:15,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:55:15,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:55:15,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:55:15,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:55:15,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:55:15,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:55:15,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:55:15,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:55:15,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:55:15,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:55:15,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:55:15,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:55:15,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:55:15,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:55:15,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:55:15,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:55:15,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:55:15,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:55:15,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:55:15,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:55:15,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:55:15,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:55:15,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:55:15,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:55:15,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:55:15,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:55:15,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:55:15,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:55:15,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:55:15,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:55:15,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:55:15,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:55:15,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:55:15,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:55:15,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:55:15,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:55:15,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:55:15,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:55:15,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:55:15,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:55:15,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:55:15,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:55:15,783 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:55:15,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:55:15,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:55:15,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:55:15,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:55:15,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:55:15,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:55:15,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:55:15,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:55:15,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:55:15,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:55:15,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:55:15,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:55:15,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:55:15,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:55:15,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:55:15,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:55:15,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:55:15,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:55:15,789 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:55:15,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:55:15,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:55:15,789 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_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/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_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN 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-20 10:55:16,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:55:16,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:55:16,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:55:16,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:55:16,125 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:55:16,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-20 10:55:19,181 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:55:19,800 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:55:19,800 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-20 10:55:19,848 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/data/ded4fbbd1/5feadd6f745d4f3b8018c317c16acbbe/FLAG4aecc1201 [2022-11-20 10:55:19,865 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/data/ded4fbbd1/5feadd6f745d4f3b8018c317c16acbbe [2022-11-20 10:55:19,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:55:19,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:55:19,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:55:19,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:55:19,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:55:19,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:55:19" (1/1) ... [2022-11-20 10:55:19,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e6c2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:19, skipping insertion in model container [2022-11-20 10:55:19,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:55:19" (1/1) ... [2022-11-20 10:55:19,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:55:20,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:55:20,339 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-20 10:55:20,348 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-20 10:55:21,571 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,573 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,577 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,578 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,581 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,604 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,605 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,616 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:21,619 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,242 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:55:22,244 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:55:22,245 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:55:22,248 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:55:22,252 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:55:22,253 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:55:22,258 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:55:22,259 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:55:22,260 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:55:22,262 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:55:22,471 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:55:22,573 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,574 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:55:22,710 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:55:22,725 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-20 10:55:22,725 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-20 10:55:22,763 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,764 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,764 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,839 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,840 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,846 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,847 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,848 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,849 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:22,936 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:55:22,942 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:55:22,961 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:55:22,961 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:55:22,962 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:55:22,962 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:55:22,963 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:55:22,963 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:55:22,964 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:55:22,964 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:55:22,984 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:55:23,034 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:23,034 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:55:23,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:55:23,389 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:55:23,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23 WrapperNode [2022-11-20 10:55:23,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:55:23,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:55:23,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:55:23,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:55:23,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,606 INFO L138 Inliner]: procedures = 690, calls = 2734, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 811 [2022-11-20 10:55:23,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:55:23,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:55:23,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:55:23,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:55:23,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,710 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:55:23,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:55:23,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:55:23,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:55:23,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (1/1) ... [2022-11-20 10:55:23,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:55:23,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:23,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:23,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:55:23,814 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-20 10:55:23,815 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-20 10:55:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:55:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-20 10:55:23,815 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-20 10:55:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-11-20 10:55:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-20 10:55:23,815 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-20 10:55:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-20 10:55:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-20 10:55:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:55:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-20 10:55:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-20 10:55:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-20 10:55:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-20 10:55:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 10:55:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 10:55:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:55:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:55:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:55:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:55:23,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:55:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-20 10:55:23,819 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-20 10:55:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-20 10:55:23,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-20 10:55:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-20 10:55:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-20 10:55:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:55:23,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:55:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-20 10:55:23,821 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-20 10:55:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:55:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-20 10:55:23,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-20 10:55:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:55:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-11-20 10:55:23,822 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-11-20 10:55:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-20 10:55:23,822 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-20 10:55:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-20 10:55:23,822 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-20 10:55:23,822 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-20 10:55:23,823 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-20 10:55:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:55:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-11-20 10:55:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:55:24,176 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:55:24,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:55:24,391 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-11-20 10:55:25,821 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:55:25,831 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:55:25,835 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:55:25,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:25 BoogieIcfgContainer [2022-11-20 10:55:25,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:55:25,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:55:25,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:55:25,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:55:25,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:55:19" (1/3) ... [2022-11-20 10:55:25,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a5ddeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:55:25, skipping insertion in model container [2022-11-20 10:55:25,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:23" (2/3) ... [2022-11-20 10:55:25,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a5ddeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:55:25, skipping insertion in model container [2022-11-20 10:55:25,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:25" (3/3) ... [2022-11-20 10:55:25,851 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-11-20 10:55:25,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:55:25,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:55:25,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:55:25,966 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;@49987194, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:55:25,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:55:25,971 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-20 10:55:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:55:25,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:25,985 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-20 10:55:25,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-11-20 10:55:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:26,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045454604] [2022-11-20 10:55:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:55:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,984 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-20 10:55:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:26,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045454604] [2022-11-20 10:55:26,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045454604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:26,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:26,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:55:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443024587] [2022-11-20 10:55:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:26,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:55:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:55:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:55:27,057 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-20 10:55:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:27,572 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-11-20 10:55:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:55:27,575 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-20 10:55:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:27,585 INFO L225 Difference]: With dead ends: 283 [2022-11-20 10:55:27,585 INFO L226 Difference]: Without dead ends: 147 [2022-11-20 10:55:27,589 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-20 10:55:27,593 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 102 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:27,594 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.4s Time] [2022-11-20 10:55:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-20 10:55:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-11-20 10:55:27,642 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-20 10:55:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-11-20 10:55:27,646 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-11-20 10:55:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:27,647 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-11-20 10:55:27,647 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-20 10:55:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-11-20 10:55:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:55:27,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:27,650 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-20 10:55:27,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:55:27,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-11-20 10:55:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:27,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331348400] [2022-11-20 10:55:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:55:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,569 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-20 10:55:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:28,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331348400] [2022-11-20 10:55:28,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331348400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:28,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:28,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:55:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571854437] [2022-11-20 10:55:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:28,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:55:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:28,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:55:28,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:28,572 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-20 10:55:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:29,400 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-11-20 10:55:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:55:29,401 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-20 10:55:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:29,403 INFO L225 Difference]: With dead ends: 196 [2022-11-20 10:55:29,403 INFO L226 Difference]: Without dead ends: 152 [2022-11-20 10:55:29,404 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-20 10:55:29,405 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 104 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:29,405 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.7s Time] [2022-11-20 10:55:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-20 10:55:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-11-20 10:55:29,434 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-20 10:55:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-11-20 10:55:29,452 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-11-20 10:55:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:29,453 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-11-20 10:55:29,453 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-20 10:55:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-11-20 10:55:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 10:55:29,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:29,455 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-20 10:55:29,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:55:29,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:29,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-11-20 10:55:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:29,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634538688] [2022-11-20 10:55:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:55:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,546 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-20 10:55:30,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:30,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634538688] [2022-11-20 10:55:30,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634538688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:30,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:30,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:55:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275738016] [2022-11-20 10:55:30,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:30,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:55:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:30,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:55:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:55:30,552 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-20 10:55:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:31,534 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-11-20 10:55:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:55:31,535 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-20 10:55:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:31,538 INFO L225 Difference]: With dead ends: 217 [2022-11-20 10:55:31,538 INFO L226 Difference]: Without dead ends: 178 [2022-11-20 10:55:31,539 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-20 10:55:31,539 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:31,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 415 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:55:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-20 10:55:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-11-20 10:55:31,561 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-20 10:55:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-11-20 10:55:31,563 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-11-20 10:55:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:31,563 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-11-20 10:55:31,564 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-20 10:55:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-11-20 10:55:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-20 10:55:31,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:31,565 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-20 10:55:31,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:55:31,566 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-11-20 10:55:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:31,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004977760] [2022-11-20 10:55:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:55:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:32,947 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-20 10:55:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:32,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004977760] [2022-11-20 10:55:32,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004977760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:32,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:32,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:55:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960613954] [2022-11-20 10:55:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:32,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:55:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:55:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:55:32,952 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-20 10:55:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:34,527 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-11-20 10:55:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:55:34,528 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-20 10:55:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:34,530 INFO L225 Difference]: With dead ends: 178 [2022-11-20 10:55:34,530 INFO L226 Difference]: Without dead ends: 161 [2022-11-20 10:55:34,531 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-20 10:55:34,532 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 193 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:34,532 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.4s Time] [2022-11-20 10:55:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-20 10:55:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-11-20 10:55:34,560 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-20 10:55:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-11-20 10:55:34,562 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-11-20 10:55:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:34,567 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-11-20 10:55:34,567 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-20 10:55:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-11-20 10:55:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-20 10:55:34,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:34,578 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-20 10:55:34,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:55:34,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-11-20 10:55:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:34,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755462085] [2022-11-20 10:55:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:55:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:55:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:55:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:55:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:55:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:55:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:55:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 10:55:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:55:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:35,559 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-20 10:55:35,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:35,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755462085] [2022-11-20 10:55:35,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755462085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:35,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:35,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:55:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386836529] [2022-11-20 10:55:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:35,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:55:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:55:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:55:35,562 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-20 10:55:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:36,804 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-11-20 10:55:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:55:36,805 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-20 10:55:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:36,807 INFO L225 Difference]: With dead ends: 206 [2022-11-20 10:55:36,807 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 10:55:36,808 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-20 10:55:36,809 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 171 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:36,810 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.0s Time] [2022-11-20 10:55:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 10:55:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-20 10:55:36,846 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-20 10:55:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-11-20 10:55:36,849 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-11-20 10:55:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:36,850 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-11-20 10:55:36,850 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-20 10:55:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-11-20 10:55:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-20 10:55:36,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:36,854 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-20 10:55:36,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:55:36,855 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-11-20 10:55:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:36,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842518023] [2022-11-20 10:55:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:55:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:55:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:55:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:55:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:55:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:55:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:55:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:55:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:55:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:55:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:38,111 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-20 10:55:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:38,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842518023] [2022-11-20 10:55:38,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842518023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:38,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:38,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:55:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020430695] [2022-11-20 10:55:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:38,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:55:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:38,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:55:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:55:38,116 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-20 10:55:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:39,382 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-11-20 10:55:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:55:39,383 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-20 10:55:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:39,385 INFO L225 Difference]: With dead ends: 212 [2022-11-20 10:55:39,385 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 10:55:39,386 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-20 10:55:39,387 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.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:39,387 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.0s Time] [2022-11-20 10:55:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 10:55:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-11-20 10:55:39,400 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-20 10:55:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-11-20 10:55:39,401 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-11-20 10:55:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:39,401 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-11-20 10:55:39,402 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-20 10:55:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-11-20 10:55:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-20 10:55:39,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:39,403 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-20 10:55:39,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:55:39,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-11-20 10:55:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:39,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075569328] [2022-11-20 10:55:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:55:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:55:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:55:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:55:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:55:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:55:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:55:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:43,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:55:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:55:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:43,673 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-20 10:55:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:43,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075569328] [2022-11-20 10:55:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075569328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:43,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:43,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-20 10:55:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780562182] [2022-11-20 10:55:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:43,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 10:55:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 10:55:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:55:43,676 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-20 10:55:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:46,699 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-11-20 10:55:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:55:46,700 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-20 10:55:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:46,702 INFO L225 Difference]: With dead ends: 190 [2022-11-20 10:55:46,702 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 10:55:46,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 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-20 10:55:46,704 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:46,704 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.4s Time] [2022-11-20 10:55:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 10:55:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-11-20 10:55:46,720 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-20 10:55:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-11-20 10:55:46,721 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-11-20 10:55:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:46,722 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-11-20 10:55:46,722 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-20 10:55:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-11-20 10:55:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-20 10:55:46,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:46,725 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-20 10:55:46,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:55:46,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-11-20 10:55:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:46,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742917443] [2022-11-20 10:55:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:55:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:55:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:55:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:55:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:55:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:55:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:55:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:55:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 10:55:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,444 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-20 10:55:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:47,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742917443] [2022-11-20 10:55:47,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742917443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:47,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:47,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:55:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938618752] [2022-11-20 10:55:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:47,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:55:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:55:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:55:47,448 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-20 10:55:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:48,618 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-11-20 10:55:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:55:48,619 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-20 10:55:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:48,620 INFO L225 Difference]: With dead ends: 225 [2022-11-20 10:55:48,620 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 10:55:48,620 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-20 10:55:48,621 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:48,621 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.0s Time] [2022-11-20 10:55:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 10:55:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-20 10:55:48,633 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-20 10:55:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-11-20 10:55:48,634 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-11-20 10:55:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:48,634 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-11-20 10:55:48,635 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-20 10:55:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-11-20 10:55:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 10:55:48,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:48,637 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-20 10:55:48,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:55:48,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-11-20 10:55:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834109800] [2022-11-20 10:55:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:55:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:55:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:55:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:55:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:55:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:55:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:55:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:55:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 10:55:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:49,619 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-20 10:55:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834109800] [2022-11-20 10:55:49,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834109800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:49,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:49,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:55:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068566808] [2022-11-20 10:55:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:49,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:55:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:55:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:55:49,622 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-20 10:55:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:50,460 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-11-20 10:55:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:55:50,461 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-20 10:55:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:50,462 INFO L225 Difference]: With dead ends: 166 [2022-11-20 10:55:50,463 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 10:55:50,463 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-20 10:55:50,464 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-20 10:55:50,464 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-20 10:55:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 10:55:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-20 10:55:50,475 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-20 10:55:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-11-20 10:55:50,477 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-11-20 10:55:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:50,477 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-11-20 10:55:50,478 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-20 10:55:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-11-20 10:55:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 10:55:50,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:50,480 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-20 10:55:50,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:55:50,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:55:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-11-20 10:55:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764592276] [2022-11-20 10:55:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:55:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:55:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:55:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:55:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:55:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:55:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:55:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:55:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:55:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:55:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:55:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:55:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:55:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:55:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:54,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:55:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:55:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:55:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:54,606 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-20 10:55:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:54,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764592276] [2022-11-20 10:55:54,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764592276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:54,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184731960] [2022-11-20 10:55:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:54,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:54,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:54,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:54,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:55:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:55,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 2933 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-20 10:55:55,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:56,458 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-20 10:55:57,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:57,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:57,476 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 10:55:57,476 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-20 10:55:57,597 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:55:57,598 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-20 10:55:58,833 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 10:55:58,834 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-20 10:55:59,012 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-20 10:55:59,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:01,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184731960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:01,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:56:01,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-11-20 10:56:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847846959] [2022-11-20 10:56:01,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-20 10:56:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-20 10:56:01,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4118, Unknown=2, NotChecked=0, Total=4290 [2022-11-20 10:56:01,802 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-20 10:56:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:08,273 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-20 10:56:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 10:56:08,274 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-20 10:56:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:08,275 INFO L225 Difference]: With dead ends: 174 [2022-11-20 10:56:08,275 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 10:56:08,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=466, Invalid=9038, Unknown=2, NotChecked=0, Total=9506 [2022-11-20 10:56:08,280 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 253 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4178 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:08,280 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.3s Time] [2022-11-20 10:56:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 10:56:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-11-20 10:56:08,294 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-20 10:56:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-11-20 10:56:08,295 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-11-20 10:56:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:08,296 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-11-20 10:56:08,296 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-20 10:56:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-11-20 10:56:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-20 10:56:08,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:08,298 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-20 10:56:08,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:08,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-11-20 10:56:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:08,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270204454] [2022-11-20 10:56:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:56:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:56:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:56:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:56:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:56:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:56:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:56:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:56:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:56:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:56:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:56:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:56:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:56:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:56:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:56:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 10:56:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:13,161 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-20 10:56:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:13,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270204454] [2022-11-20 10:56:13,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270204454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:13,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936814491] [2022-11-20 10:56:13,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:56:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:13,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:13,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:56:14,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:56:14,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:56:14,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 10:56:14,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:14,943 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-20 10:56:15,081 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_10| Int) (v_ArrVal_1303 Int)) (and (= |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~loopctr1316_10| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1303))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_10|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_10| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-20 10:56:15,117 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_10| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| Int) (v_ArrVal_1303 Int) (v_ArrVal_1307 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67|))) (and (= |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~loopctr1316_10| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1303) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_1307))) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_10|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_10| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| .cse0)) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))))) is different from true [2022-11-20 10:56:15,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:15,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:15,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:15,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:15,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:15,724 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 10:56:15,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2022-11-20 10:56:15,837 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:56:15,838 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-20 10:56:16,900 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 10:56:16,900 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-20 10:56:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 3 not checked. [2022-11-20 10:56:17,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:20,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936814491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:20,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:56:20,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-11-20 10:56:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125401415] [2022-11-20 10:56:20,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:20,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 10:56:20,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:20,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 10:56:20,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=3054, Unknown=3, NotChecked=222, Total=3422 [2022-11-20 10:56:20,518 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 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-20 10:56:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:56:30,041 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-11-20 10:56:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 10:56:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 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-20 10:56:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:56:30,043 INFO L225 Difference]: With dead ends: 173 [2022-11-20 10:56:30,043 INFO L226 Difference]: Without dead ends: 122 [2022-11-20 10:56:30,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=331, Invalid=6643, Unknown=6, NotChecked=330, Total=7310 [2022-11-20 10:56:30,046 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 120 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 921 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:56:30,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1590 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2996 Invalid, 0 Unknown, 921 Unchecked, 3.4s Time] [2022-11-20 10:56:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-20 10:56:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-20 10:56:30,059 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-20 10:56:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-11-20 10:56:30,060 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-11-20 10:56:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:56:30,061 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-11-20 10:56:30,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 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-20 10:56:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-11-20 10:56:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-20 10:56:30,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:56:30,063 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-20 10:56:30,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:56:30,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:30,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:56:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-11-20 10:56:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:30,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176641996] [2022-11-20 10:56:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:56:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:56:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:56:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:56:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:56:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:56:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:56:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:56:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:56:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:56:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:56:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:56:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:56:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:56:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:56:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:56:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 10:56:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:56:34,550 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-20 10:56:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:56:34,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176641996] [2022-11-20 10:56:34,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176641996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:34,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721456406] [2022-11-20 10:56:34,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:56:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:56:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:56:34,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:56:34,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:56:36,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:56:36,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:56:36,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 2873 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-20 10:56:36,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:37,215 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-20 10:56:37,369 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_21| Int) (v_ArrVal_1993 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_21| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_21|) (= (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~loopctr1316_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1993)) |c_#memory_int|))) is different from true [2022-11-20 10:56:37,390 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_22| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_21| Int) (v_ArrVal_1993 Int) (v_ArrVal_1995 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_21| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_22|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_22| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_21|) (= (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~loopctr1316_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1993) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_22| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1995)) |c_#memory_int|))) is different from true [2022-11-20 10:56:37,413 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_22| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_21| Int) (v_ArrVal_2000 Int) (v_ArrVal_1993 Int) (v_ArrVal_1995 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_23| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_22| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_23|) (= (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~loopctr1316_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1993) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_22| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1995) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_23| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2000)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_21| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_22|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_21|))) is different from true [2022-11-20 10:56:37,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:37,965 INFO L321 Elim1Store]: treesize reduction 16, result has 46.7 percent of original size [2022-11-20 10:56:37,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 56 [2022-11-20 10:56:38,067 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:56:38,067 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-20 10:56:39,112 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 10:56:39,112 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-20 10:56:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 6 not checked. [2022-11-20 10:56:39,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:54,224 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:56:54,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721456406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:56:54,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:56:54,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-11-20 10:56:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119471879] [2022-11-20 10:56:54,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:54,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 10:56:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 10:56:54,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3167, Unknown=4, NotChecked=342, Total=3660 [2022-11-20 10:56:54,229 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 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-20 10:57:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:08,126 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-20 10:57:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 10:57:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 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-20 10:57:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:08,128 INFO L225 Difference]: With dead ends: 174 [2022-11-20 10:57:08,128 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 10:57:08,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=336, Invalid=6976, Unknown=10, NotChecked=510, Total=7832 [2022-11-20 10:57:08,131 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 4204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1057 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:08,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1654 Invalid, 4204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3022 Invalid, 0 Unknown, 1057 Unchecked, 3.6s Time] [2022-11-20 10:57:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 10:57:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-20 10:57:08,145 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-20 10:57:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-11-20 10:57:08,146 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-11-20 10:57:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:08,147 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-11-20 10:57:08,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 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-20 10:57:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-11-20 10:57:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-20 10:57:08,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:08,149 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-20 10:57:08,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:08,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:08,365 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-11-20 10:57:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955867259] [2022-11-20 10:57:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:57:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:57:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:57:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:57:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:57:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:57:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:57:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:57:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:57:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:57:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:57:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:57:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:57:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:57:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 10:57:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:12,411 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-20 10:57:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:12,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955867259] [2022-11-20 10:57:12,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955867259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:12,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595086792] [2022-11-20 10:57:12,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:57:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:12,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:12,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:57:14,809 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:57:14,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:57:14,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-20 10:57:14,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:15,698 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-20 10:57:15,904 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (v_ArrVal_2873 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|))) (and (= |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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2873))) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-20 10:57:15,946 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_37| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_37| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_37|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2873) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_37| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2875)) |c_#memory_int|)))) is different from true [2022-11-20 10:57:16,008 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (v_ArrVal_2882 Int) (v_ArrVal_2873 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_38| Int) (v_ArrVal_2875 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_37| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_37|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= |c_#memory_int| (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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2873) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_37| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2875) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_38| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2882))) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_37| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_38|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_38| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-20 10:57:16,071 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (v_ArrVal_2883 Int) (v_ArrVal_2882 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_39| Int) (v_ArrVal_2873 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_38| Int) (v_ArrVal_2875 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_37| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_37|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_37| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_38|) (= |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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_36_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2873) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_37| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2875) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_38| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2882) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_39| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2883))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_38| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_39|)))) is different from true [2022-11-20 10:57:17,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:17,217 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2022-11-20 10:57:17,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 67 [2022-11-20 10:57:17,382 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:57:17,382 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-20 10:57:18,628 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 10:57:18,628 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-20 10:57:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 57 trivial. 10 not checked. [2022-11-20 10:57:18,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:28,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595086792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:28,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:57:28,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 41] total 64 [2022-11-20 10:57:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678874432] [2022-11-20 10:57:28,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:57:28,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-20 10:57:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-20 10:57:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=4525, Unknown=5, NotChecked=548, Total=5256 [2022-11-20 10:57:28,226 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-20 10:57:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:45,652 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2022-11-20 10:57:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-20 10:57:45,653 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-20 10:57:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:45,654 INFO L225 Difference]: With dead ends: 177 [2022-11-20 10:57:45,655 INFO L226 Difference]: Without dead ends: 126 [2022-11-20 10:57:45,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=494, Invalid=10852, Unknown=12, NotChecked=852, Total=12210 [2022-11-20 10:57:45,660 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 269 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1244 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:45,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1588 Invalid, 6070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 4604 Invalid, 0 Unknown, 1244 Unchecked, 5.3s Time] [2022-11-20 10:57:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-20 10:57:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-11-20 10:57:45,678 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-20 10:57:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-11-20 10:57:45,679 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-11-20 10:57:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:45,680 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-11-20 10:57:45,680 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-20 10:57:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-11-20 10:57:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-20 10:57:45,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:45,700 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-20 10:57:45,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:45,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 10:57:45,930 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-11-20 10:57:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:45,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001161699] [2022-11-20 10:57:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:57:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:57:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:57:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:57:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:57:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:57:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:57:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:57:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:57:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:57:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:57:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:57:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:57:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:57:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 10:57:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:50,658 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-20 10:57:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001161699] [2022-11-20 10:57:50,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001161699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773694660] [2022-11-20 10:57:50,659 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:57:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:50,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:50,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:58:17,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-20 10:58:17,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:58:17,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 3469 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-20 10:58:17,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:18,674 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-20 10:58:19,004 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3946 Int) (v_ArrVal_3942 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_56| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_56|) (= (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_3942) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3946)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-20 10:58:19,033 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3946 Int) (v_ArrVal_3942 Int) (v_ArrVal_3951 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_57| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_56| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_56|) (= (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_3942) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3946) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_57| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3951)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_57| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_57|)))) is different from true [2022-11-20 10:58:19,071 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3946 Int) (v_ArrVal_3955 Int) (v_ArrVal_3942 Int) (v_ArrVal_3951 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_57| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_56| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_58| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_56|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_57| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_58|) (= (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_3942) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3946) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_57| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3951) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_58| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3955)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_57|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_58| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-20 10:58:19,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3946 Int) (v_ArrVal_3955 Int) (v_ArrVal_3942 Int) (v_ArrVal_3951 Int) (v_ArrVal_3960 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_57| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_56| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_59| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_58| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_56|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_57| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_58|) (= (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_3942) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3946) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_57| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3951) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_58| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3955) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_59| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3960)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_56| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_57|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_58| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_59|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-20 10:58:20,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:20,183 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 44 treesize of output 56 [2022-11-20 10:58:20,333 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:58:20,334 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-20 10:58:21,709 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 10:58:21,710 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-20 10:58:21,953 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-20 10:58:21,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:58:36,250 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:58:36,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773694660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:36,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:58:36,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 44] total 70 [2022-11-20 10:58:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963139790] [2022-11-20 10:58:36,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:58:36,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 10:58:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:36,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 10:58:36,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=5367, Unknown=7, NotChecked=596, Total=6162 [2022-11-20 10:58:36,261 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-20 10:58:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:56,681 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2022-11-20 10:58:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-20 10:58:56,682 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-20 10:58:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:56,683 INFO L225 Difference]: With dead ends: 176 [2022-11-20 10:58:56,683 INFO L226 Difference]: Without dead ends: 130 [2022-11-20 10:58:56,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=523, Invalid=13049, Unknown=16, NotChecked=932, Total=14520 [2022-11-20 10:58:56,686 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 178 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 4782 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 6285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 4782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1351 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:56,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1831 Invalid, 6285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 4782 Invalid, 0 Unknown, 1351 Unchecked, 5.4s Time] [2022-11-20 10:58:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-20 10:58:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2022-11-20 10:58:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.0875) internal successors, (87), 81 states have internal predecessors, (87), 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-20 10:58:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2022-11-20 10:58:56,701 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 140 [2022-11-20 10:58:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:56,702 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2022-11-20 10:58:56,702 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-20 10:58:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2022-11-20 10:58:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-20 10:58:56,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:56,704 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 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-20 10:58:56,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 10:58:56,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:58:56,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:58:56,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash -723622004, now seen corresponding path program 6 times [2022-11-20 10:58:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:56,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831200614] [2022-11-20 10:58:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:58:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:58:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:58:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:58:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:58:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:58:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:58:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:58:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:58:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:58:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:58:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:58:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:58:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:58:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:58:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:58:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:58:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:58:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:58:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:58:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:58:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-20 10:58:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-20 10:58:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831200614] [2022-11-20 10:58:58,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831200614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367695237] [2022-11-20 10:58:58,623 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:58:58,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:58,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:58,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:58,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:59:43,256 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-20 10:59:43,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:59:43,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 3466 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 10:59:43,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-20 10:59:43,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:59:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-20 10:59:43,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367695237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:59:43,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:59:43,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 25 [2022-11-20 10:59:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833588722] [2022-11-20 10:59:43,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:59:43,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:59:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:43,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:59:43,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:59:43,741 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 25 states, 25 states have (on average 3.64) internal successors, (91), 21 states have internal predecessors, (91), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-20 10:59:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:48,205 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2022-11-20 10:59:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:59:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 21 states have internal predecessors, (91), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-11-20 10:59:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:48,207 INFO L225 Difference]: With dead ends: 189 [2022-11-20 10:59:48,207 INFO L226 Difference]: Without dead ends: 140 [2022-11-20 10:59:48,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 10:59:48,208 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 236 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:48,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 653 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-20 10:59:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-20 10:59:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-11-20 10:59:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 85 states have internal predecessors, (93), 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-20 10:59:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2022-11-20 10:59:48,229 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 141 [2022-11-20 10:59:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:48,230 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2022-11-20 10:59:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 21 states have internal predecessors, (91), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-20 10:59:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2022-11-20 10:59:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-20 10:59:48,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:48,232 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-20 10:59:48,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:59:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:59:48,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash 658643854, now seen corresponding path program 7 times [2022-11-20 10:59:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:48,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658739596] [2022-11-20 10:59:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 10:59:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 10:59:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:59:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:59:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:59:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:59:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:59:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:59:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:51,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:59:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:52,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 10:59:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:53,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-20 10:59:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:53,182 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-20 10:59:53,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658739596] [2022-11-20 10:59:53,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658739596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:59:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281520331] [2022-11-20 10:59:53,183 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 10:59:53,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:59:53,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:59:53,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:59:53,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:59:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:54,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 3603 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-20 10:59:54,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:55,598 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-20 10:59:56,663 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_6250 Int) (v_ArrVal_6246 Int) (v_ArrVal_6257 Int) (v_ArrVal_6256 Int) (v_ArrVal_6267 Int) (v_ArrVal_6264 Int)) (= |c_#memory_int| (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6246) (+ |c_#Ultimate.C_memcpy_dest.offset| 1) v_ArrVal_6250) (+ 2 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6256) (+ 3 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6257) (+ |c_#Ultimate.C_memcpy_dest.offset| 4) v_ArrVal_6264) (+ 5 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6267))))) is different from true [2022-11-20 10:59:57,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 67 [2022-11-20 10:59:57,725 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 10:59:57,725 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-20 10:59:59,119 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 10:59:59,120 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-20 10:59:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 57 trivial. 6 not checked. [2022-11-20 10:59:59,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:05,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281520331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:05,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:00:05,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 43] total 70 [2022-11-20 11:00:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910260939] [2022-11-20 11:00:05,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:05,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 11:00:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:05,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 11:00:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=5806, Unknown=5, NotChecked=152, Total=6162 [2022-11-20 11:00:05,210 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 70 states, 63 states have (on average 2.126984126984127) internal successors, (134), 55 states have internal predecessors, (134), 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-20 11:00:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:20,558 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2022-11-20 11:00:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 11:00:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 63 states have (on average 2.126984126984127) internal successors, (134), 55 states have internal predecessors, (134), 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 141 [2022-11-20 11:00:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:20,560 INFO L225 Difference]: With dead ends: 180 [2022-11-20 11:00:20,560 INFO L226 Difference]: Without dead ends: 132 [2022-11-20 11:00:20,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2428 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=529, Invalid=12573, Unknown=12, NotChecked=226, Total=13340 [2022-11-20 11:00:20,563 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 256 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 4660 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 5962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 4660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:20,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1678 Invalid, 5962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 4660 Invalid, 0 Unknown, 1087 Unchecked, 5.1s Time] [2022-11-20 11:00:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-20 11:00:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-11-20 11:00:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 85 states have internal predecessors, (92), 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-20 11:00:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2022-11-20 11:00:20,583 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 141 [2022-11-20 11:00:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:20,584 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2022-11-20 11:00:20,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 63 states have (on average 2.126984126984127) internal successors, (134), 55 states have internal predecessors, (134), 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-20 11:00:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2022-11-20 11:00:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-20 11:00:20,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:20,586 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-20 11:00:20,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 11:00:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 11:00:20,800 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -359058118, now seen corresponding path program 8 times [2022-11-20 11:00:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:20,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5249772] [2022-11-20 11:00:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:00:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:00:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:00:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:00:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:00:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:00:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 11:00:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:00:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 11:00:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 11:00:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:00:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:00:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:00:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:00:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:00:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:00:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:00:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:00:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:00:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:00:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 11:00:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 11:00:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:25,831 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-20 11:00:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:25,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5249772] [2022-11-20 11:00:25,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5249772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:25,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774284580] [2022-11-20 11:00:25,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:00:25,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:25,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:25,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:00:38,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:00:38,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:00:38,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 3737 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-20 11:00:38,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:38,884 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-20 11:00:39,053 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7697 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:39,070 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7702 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_7697 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7702)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:39,093 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7702 Int) (v_ArrVal_7705 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_7697 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7702) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7705)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:39,127 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7709 Int) (v_ArrVal_7702 Int) (v_ArrVal_7705 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_7697 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7702) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7705) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7709)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:39,174 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7709 Int) (v_ArrVal_7702 Int) (v_ArrVal_7705 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_7712 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (v_ArrVal_7697 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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7702) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7705) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7709) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7712)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:39,249 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7709 Int) (v_ArrVal_7702 Int) (v_ArrVal_7705 Int) (v_ArrVal_7716 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_7712 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (v_ArrVal_7697 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7702) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7705) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7709) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7712) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7716)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:39,331 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7719 Int) (v_ArrVal_7709 Int) (v_ArrVal_7702 Int) (v_ArrVal_7705 Int) (v_ArrVal_7716 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_7712 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (v_ArrVal_7697 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_116| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_116|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7697) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7702) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7705) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7709) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7712) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7716) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7719)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-11-20 11:00:40,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:40,782 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 11:00:40,782 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-20 11:00:40,909 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 11:00:40,909 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-20 11:00:42,095 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 11:00:42,095 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-20 11:00:42,326 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-20 11:00:42,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:59,179 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 134 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:00:59,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774284580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:59,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:00:59,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2022-11-20 11:00:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972077931] [2022-11-20 11:00:59,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:59,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-20 11:00:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-20 11:00:59,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3880, Unknown=10, NotChecked=910, Total=4970 [2022-11-20 11:00:59,185 INFO L87 Difference]: Start difference. First operand 130 states and 153 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-20 11:01:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:16,980 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2022-11-20 11:01:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 11:01:16,981 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-20 11:01:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:16,982 INFO L225 Difference]: With dead ends: 178 [2022-11-20 11:01:16,982 INFO L226 Difference]: Without dead ends: 130 [2022-11-20 11:01:16,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=385, Invalid=8932, Unknown=23, NotChecked=1372, Total=10712 [2022-11-20 11:01:16,985 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 144 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 3580 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:01:16,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1846 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3580 Invalid, 0 Unknown, 1411 Unchecked, 4.6s Time] [2022-11-20 11:01:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-20 11:01:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-20 11:01:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 85 states have internal predecessors, (91), 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-20 11:01:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-11-20 11:01:17,008 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 142 [2022-11-20 11:01:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:17,009 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-11-20 11:01:17,009 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-20 11:01:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-11-20 11:01:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-20 11:01:17,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:17,011 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-20 11:01:17,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:01:17,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:17,215 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1843048178, now seen corresponding path program 9 times [2022-11-20 11:01:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:17,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903353744] [2022-11-20 11:01:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:01:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:01:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:01:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:01:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:01:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:01:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 11:01:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:01:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 11:01:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 11:01:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:01:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:01:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:01:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:01:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:01:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:01:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:01:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:01:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:01:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:01:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 11:01:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 11:01:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:22,588 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-20 11:01:22,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:22,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903353744] [2022-11-20 11:01:22,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903353744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:01:22,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075774717] [2022-11-20 11:01:22,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:01:22,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:01:22,591 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:01:22,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:04:36,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:04:36,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:04:36,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 3451 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-20 11:04:36,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:04:36,609 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-20 11:04:36,736 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 17 treesize of output 9 [2022-11-20 11:04:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-11-20 11:04:37,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:04:40,194 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-20 11:04:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-11-20 11:04:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075774717] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:04:40,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:04:40,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 22] total 56 [2022-11-20 11:04:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473435241] [2022-11-20 11:04:40,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:04:40,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 11:04:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:04:40,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 11:04:40,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2022-11-20 11:04:40,490 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 56 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 47 states have internal predecessors, (127), 20 states have call successors, (44), 7 states have call predecessors, (44), 13 states have return successors, (42), 23 states have call predecessors, (42), 19 states have call successors, (42) [2022-11-20 11:05:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:05:03,736 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2022-11-20 11:05:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 11:05:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 47 states have internal predecessors, (127), 20 states have call successors, (44), 7 states have call predecessors, (44), 13 states have return successors, (42), 23 states have call predecessors, (42), 19 states have call successors, (42) Word has length 143 [2022-11-20 11:05:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:05:03,738 INFO L225 Difference]: With dead ends: 179 [2022-11-20 11:05:03,738 INFO L226 Difference]: Without dead ends: 129 [2022-11-20 11:05:03,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=418, Invalid=7414, Unknown=0, NotChecked=0, Total=7832 [2022-11-20 11:05:03,740 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 129 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 3817 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 3886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:05:03,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1680 Invalid, 3886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3817 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2022-11-20 11:05:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-20 11:05:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-20 11:05:03,767 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-20 11:05:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2022-11-20 11:05:03,769 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 143 [2022-11-20 11:05:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:05:03,769 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2022-11-20 11:05:03,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 48 states have (on average 2.6458333333333335) internal successors, (127), 47 states have internal predecessors, (127), 20 states have call successors, (44), 7 states have call predecessors, (44), 13 states have return successors, (42), 23 states have call predecessors, (42), 19 states have call successors, (42) [2022-11-20 11:05:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-11-20 11:05:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-20 11:05:03,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:05:03,771 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-20 11:05:03,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:05:03,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 11:05:03,987 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:05:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:05:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2125296268, now seen corresponding path program 10 times [2022-11-20 11:05:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:05:03,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140740821] [2022-11-20 11:05:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:05:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:05:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:05:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:05:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:05:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:05:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:05:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:05:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 11:05:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:05:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 11:05:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 11:05:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:05:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:05:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:05:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:05:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:05:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:05:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:05:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:05:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:05:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:05:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 11:05:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 11:05:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:05:11,541 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-20 11:05:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:05:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140740821] [2022-11-20 11:05:11,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140740821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:05:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995140580] [2022-11-20 11:05:11,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:05:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:05:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:05:11,543 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:05:11,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:05:36,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:05:36,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:05:36,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 4028 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-20 11:05:36,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:05:37,465 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-20 11:05:37,868 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_11105 Int) (v_ArrVal_11108 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_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) is different from true [2022-11-20 11:05:37,895 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11113 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_11105 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_11108 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) is different from true [2022-11-20 11:05:37,942 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11113 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_11105 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_11108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (v_ArrVal_11118 Int)) (and (= |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_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11118))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-20 11:05:38,007 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11121 Int) (v_ArrVal_11113 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_11105 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_11108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (v_ArrVal_11118 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= (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_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11118) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11121)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) is different from true [2022-11-20 11:05:38,095 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11121 Int) (v_ArrVal_11113 Int) (v_ArrVal_11123 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_11105 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_11108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (v_ArrVal_11118 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11118) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11121) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11123)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) is different from true [2022-11-20 11:05:38,221 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11130 Int) (v_ArrVal_11121 Int) (v_ArrVal_11113 Int) (v_ArrVal_11123 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_158| Int) (v_ArrVal_11105 Int) (v_ArrVal_11108 Int) (v_ArrVal_11118 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11118) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11121) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11123) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11130)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_158|))) is different from true [2022-11-20 11:05:38,395 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11130 Int) (v_ArrVal_11133 Int) (v_ArrVal_11121 Int) (v_ArrVal_11113 Int) (v_ArrVal_11123 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_159| Int) (v_ArrVal_11105 Int) (v_ArrVal_11108 Int) (v_ArrVal_11118 Int)) (and (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11118) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11121) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11123) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11130) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11133)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_159|))) is different from true [2022-11-20 11:05:38,617 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11130 Int) (v_ArrVal_11133 Int) (v_ArrVal_11121 Int) (v_ArrVal_11113 Int) (v_ArrVal_11135 Int) (v_ArrVal_11123 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_159| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_160| Int) (v_ArrVal_11105 Int) (v_ArrVal_11108 Int) (v_ArrVal_11118 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_160|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_11105) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11113) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11118) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11121) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11123) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11130) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11133) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_160| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11135)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_159|))) is different from true [2022-11-20 11:05:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:05:42,898 INFO L321 Elim1Store]: treesize reduction 120, result has 48.5 percent of original size [2022-11-20 11:05:42,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 143 [2022-11-20 11:05:43,130 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 11:05:43,131 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-20 11:05:45,064 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-20 11:05:45,064 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-20 11:05:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 57 trivial. 44 not checked. [2022-11-20 11:05:45,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:06:07,136 WARN L233 SmtUtils]: Spent 18.77s 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-20 11:06:28,236 WARN L233 SmtUtils]: Spent 13.05s on a formula simplification that was a NOOP. DAG size: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:06:28,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995140580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:28,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:06:28,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 47] total 78 [2022-11-20 11:06:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106941221] [2022-11-20 11:06:28,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:06:28,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-20 11:06:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-20 11:06:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=5959, Unknown=20, NotChecked=1288, Total=7482 [2022-11-20 11:06:28,245 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-20 11:06:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:06:50,484 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2022-11-20 11:06:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-20 11:06:50,485 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-20 11:06:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:06:50,487 INFO L225 Difference]: With dead ends: 181 [2022-11-20 11:06:50,487 INFO L226 Difference]: Without dead ends: 135 [2022-11-20 11:06:50,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=560, Invalid=14201, Unknown=33, NotChecked=1976, Total=16770 [2022-11-20 11:06:50,489 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 214 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 6544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1580 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:06:50,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1627 Invalid, 6544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 4788 Invalid, 0 Unknown, 1580 Unchecked, 6.1s Time] [2022-11-20 11:06:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-20 11:06:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-11-20 11:06:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 86 states have internal predecessors, (92), 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-20 11:06:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-11-20 11:06:50,520 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 145 [2022-11-20 11:06:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:06:50,521 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-11-20 11:06:50,521 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-20 11:06:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-11-20 11:06:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-20 11:06:50,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:06:50,522 INFO L195 NwaCegarLoop]: trace histogram [9, 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] [2022-11-20 11:06:50,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:06:50,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:50,727 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:06:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash 775227898, now seen corresponding path program 11 times [2022-11-20 11:06:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:50,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736377750] [2022-11-20 11:06:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:06:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:06:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:06:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:06:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:06:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 11:06:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:06:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 11:06:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 11:06:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 11:06:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:06:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:06:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:06:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:06:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 11:06:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-20 11:06:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-20 11:06:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736377750] [2022-11-20 11:06:54,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736377750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824327233] [2022-11-20 11:06:54,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:06:54,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:54,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:54,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2fa4867-6d59-4649-b2fc-489d63046009/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process