./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro --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 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa --- 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-8393723 [2022-11-18 20:46:29,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:46:29,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:46:30,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:46:30,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:46:30,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:46:30,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:46:30,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:46:30,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:46:30,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:46:30,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:46:30,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:46:30,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:46:30,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:46:30,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:46:30,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:46:30,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:46:30,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:46:30,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:46:30,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:46:30,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:46:30,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:46:30,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:46:30,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:46:30,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:46:30,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:46:30,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:46:30,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:46:30,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:46:30,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:46:30,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:46:30,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:46:30,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:46:30,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:46:30,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:46:30,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:46:30,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:46:30,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:46:30,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:46:30,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:46:30,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:46:30,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:46:30,123 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:46:30,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:46:30,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:46:30,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:46:30,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:46:30,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:46:30,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:46:30,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:46:30,126 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:46:30,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:46:30,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:46:30,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:46:30,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:46:30,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:46:30,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:46:30,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:46:30,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:46:30,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:46:30,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:46:30,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:46:30,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:46:30,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:46:30,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:46:30,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:46:30,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:46:30,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:46:30,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:46:30,131 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:46:30,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:46:30,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:46:30,132 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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro 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 -> 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa [2022-11-18 20:46:30,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:46:30,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:46:30,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:46:30,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:46:30,521 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:46:30,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2022-11-18 20:46:30,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/data/7464b0250/a1a3c1fb38df4e739c4d5db8208ba29c/FLAGe7dd7a2cf [2022-11-18 20:46:31,496 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:46:31,496 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2022-11-18 20:46:31,537 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/data/7464b0250/a1a3c1fb38df4e739c4d5db8208ba29c/FLAGe7dd7a2cf [2022-11-18 20:46:31,968 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/data/7464b0250/a1a3c1fb38df4e739c4d5db8208ba29c [2022-11-18 20:46:31,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:46:31,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:46:31,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:46:31,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:46:31,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:46:31,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:46:31" (1/1) ... [2022-11-18 20:46:31,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1952dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:31, skipping insertion in model container [2022-11-18 20:46:31,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:46:31" (1/1) ... [2022-11-18 20:46:31,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:46:32,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:46:32,418 WARN L234 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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2022-11-18 20:46:32,425 WARN L234 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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2022-11-18 20:46:33,430 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,430 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,431 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,432 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,433 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,447 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,448 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,450 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,451 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:33,844 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:46:33,847 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:46:33,848 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:46:33,849 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:46:33,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:46:33,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:46:33,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:46:33,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:46:33,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:46:33,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:46:34,040 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:46:34,160 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,161 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:46:34,388 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:46:34,417 WARN L234 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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2022-11-18 20:46:34,418 WARN L234 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_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2022-11-18 20:46:34,467 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,467 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,468 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,472 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,477 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,483 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,484 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,486 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,486 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,540 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:46:34,541 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:46:34,542 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:46:34,543 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:46:34,544 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:46:34,544 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:46:34,545 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:46:34,545 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:46:34,545 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:46:34,546 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:46:34,568 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:46:34,643 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,643 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:46:34,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:46:35,007 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:46:35,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35 WrapperNode [2022-11-18 20:46:35,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:46:35,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:46:35,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:46:35,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:46:35,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,214 INFO L138 Inliner]: procedures = 690, calls = 2736, calls flagged for inlining = 58, calls inlined = 6, statements flattened = 792 [2022-11-18 20:46:35,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:46:35,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:46:35,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:46:35,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:46:35,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,328 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:46:35,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:46:35,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:46:35,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:46:35,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (1/1) ... [2022-11-18 20:46:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:46:35,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:46:35,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:46:35,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:46:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-18 20:46:35,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-18 20:46:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:46:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-18 20:46:35,437 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-18 20:46:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-11-18 20:46:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-18 20:46:35,438 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-18 20:46:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-18 20:46:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-18 20:46:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:46:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-18 20:46:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-18 20:46:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-18 20:46:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-18 20:46:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:46:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:46:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:46:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:46:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:46:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:46:35,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:46:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-18 20:46:35,442 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-18 20:46:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2022-11-18 20:46:35,443 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2022-11-18 20:46:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 20:46:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 20:46:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-18 20:46:35,444 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-18 20:46:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:46:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:46:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-18 20:46:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-18 20:46:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:46:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-18 20:46:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-18 20:46:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:46:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-11-18 20:46:35,446 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-11-18 20:46:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-18 20:46:35,446 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-18 20:46:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-18 20:46:35,446 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-18 20:46:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:46:35,447 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:46:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:46:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-11-18 20:46:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:46:35,855 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:46:35,858 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:46:36,033 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-11-18 20:46:37,340 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:46:37,353 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:46:37,353 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:46:37,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:46:37 BoogieIcfgContainer [2022-11-18 20:46:37,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:46:37,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:46:37,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:46:37,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:46:37,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:46:31" (1/3) ... [2022-11-18 20:46:37,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d73f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:46:37, skipping insertion in model container [2022-11-18 20:46:37,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:46:35" (2/3) ... [2022-11-18 20:46:37,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d73f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:46:37, skipping insertion in model container [2022-11-18 20:46:37,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:46:37" (3/3) ... [2022-11-18 20:46:37,373 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_array_harness.i [2022-11-18 20:46:37,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:46:37,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:46:37,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:46:37,496 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;@6bb2f5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:46:37,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:46:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-18 20:46:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-18 20:46:37,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:37,511 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:37,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2057633121, now seen corresponding path program 1 times [2022-11-18 20:46:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:37,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018357829] [2022-11-18 20:46:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:46:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-18 20:46:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:38,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018357829] [2022-11-18 20:46:38,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018357829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:38,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:38,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:46:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890918552] [2022-11-18 20:46:38,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:38,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:46:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:38,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:46:38,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:46:38,578 INFO L87 Difference]: Start difference. First operand has 133 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 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-18 20:46:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:39,331 INFO L93 Difference]: Finished difference Result 277 states and 358 transitions. [2022-11-18 20:46:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:46:39,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 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 71 [2022-11-18 20:46:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:39,349 INFO L225 Difference]: With dead ends: 277 [2022-11-18 20:46:39,349 INFO L226 Difference]: Without dead ends: 144 [2022-11-18 20:46:39,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-18 20:46:39,368 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:39,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 160 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:46:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-18 20:46:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2022-11-18 20:46:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 78 states have internal predecessors, (88), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-18 20:46:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-11-18 20:46:39,451 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 71 [2022-11-18 20:46:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:39,452 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-11-18 20:46:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 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-18 20:46:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-11-18 20:46:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-18 20:46:39,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:39,459 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:39,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:46:39,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:39,465 INFO L85 PathProgramCache]: Analyzing trace with hash 866247645, now seen corresponding path program 1 times [2022-11-18 20:46:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:39,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146271322] [2022-11-18 20:46:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:39,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:46:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-18 20:46:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146271322] [2022-11-18 20:46:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146271322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:40,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:40,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:46:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427976345] [2022-11-18 20:46:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:40,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:46:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:46:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:46:40,400 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 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-18 20:46:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:41,420 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2022-11-18 20:46:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:46:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 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 71 [2022-11-18 20:46:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:41,424 INFO L225 Difference]: With dead ends: 188 [2022-11-18 20:46:41,424 INFO L226 Difference]: Without dead ends: 149 [2022-11-18 20:46:41,425 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-18 20:46:41,426 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 62 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:41,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 314 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:46:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-18 20:46:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2022-11-18 20:46:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 82 states have internal predecessors, (92), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-11-18 20:46:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2022-11-18 20:46:41,444 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 71 [2022-11-18 20:46:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:41,445 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2022-11-18 20:46:41,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 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-18 20:46:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2022-11-18 20:46:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-18 20:46:41,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:41,448 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-11-18 20:46:41,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:46:41,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1202353843, now seen corresponding path program 1 times [2022-11-18 20:46:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:41,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876458622] [2022-11-18 20:46:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:46:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-18 20:46:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:42,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876458622] [2022-11-18 20:46:42,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876458622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:42,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:42,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:46:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605764864] [2022-11-18 20:46:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:42,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:46:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:42,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:46:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:46:42,293 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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-18 20:46:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:43,311 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2022-11-18 20:46:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:46:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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 77 [2022-11-18 20:46:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:43,314 INFO L225 Difference]: With dead ends: 203 [2022-11-18 20:46:43,314 INFO L226 Difference]: Without dead ends: 162 [2022-11-18 20:46:43,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:46:43,316 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 139 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:43,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 328 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 20:46:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-18 20:46:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2022-11-18 20:46:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-18 20:46:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-11-18 20:46:43,332 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 77 [2022-11-18 20:46:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:43,333 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-11-18 20:46:43,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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-18 20:46:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-11-18 20:46:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-18 20:46:43,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:43,335 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-11-18 20:46:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:46:43,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 845366680, now seen corresponding path program 1 times [2022-11-18 20:46:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:43,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633736950] [2022-11-18 20:46:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:46:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:46:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:46:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:46:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:46:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:46:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:46:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:46:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:46:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 20:46:44,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:44,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633736950] [2022-11-18 20:46:44,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633736950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:44,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:44,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:46:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341418168] [2022-11-18 20:46:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:44,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:46:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:46:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:46:44,452 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 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-18 20:46:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:45,789 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-11-18 20:46:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:46:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 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 121 [2022-11-18 20:46:45,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:45,792 INFO L225 Difference]: With dead ends: 206 [2022-11-18 20:46:45,792 INFO L226 Difference]: Without dead ends: 152 [2022-11-18 20:46:45,792 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-18 20:46:45,793 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:45,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 420 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:46:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-18 20:46:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2022-11-18 20:46:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-11-18 20:46:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-11-18 20:46:45,814 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 121 [2022-11-18 20:46:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:45,815 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-11-18 20:46:45,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 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-18 20:46:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-11-18 20:46:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-18 20:46:45,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:45,818 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2022-11-18 20:46:45,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:46:45,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 606085033, now seen corresponding path program 1 times [2022-11-18 20:46:45,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:45,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568233766] [2022-11-18 20:46:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:46:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:46:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:46:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:46:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:46:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:46:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:46:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:46:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:46:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 20:46:47,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:47,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568233766] [2022-11-18 20:46:47,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568233766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:47,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:47,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 20:46:47,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255637608] [2022-11-18 20:46:47,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:47,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:46:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:47,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:46:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:46:47,058 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 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-18 20:46:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:48,506 INFO L93 Difference]: Finished difference Result 212 states and 256 transitions. [2022-11-18 20:46:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:46:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 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 127 [2022-11-18 20:46:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:48,510 INFO L225 Difference]: With dead ends: 212 [2022-11-18 20:46:48,510 INFO L226 Difference]: Without dead ends: 144 [2022-11-18 20:46:48,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:46:48,511 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 122 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:48,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 404 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:46:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-18 20:46:48,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2022-11-18 20:46:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 20:46:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2022-11-18 20:46:48,526 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 127 [2022-11-18 20:46:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:48,526 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2022-11-18 20:46:48,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 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-18 20:46:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-11-18 20:46:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-18 20:46:48,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:48,529 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:48,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:46:48,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1368893272, now seen corresponding path program 1 times [2022-11-18 20:46:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:48,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837712343] [2022-11-18 20:46:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:46:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:46:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:46:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:46:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:46:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:46:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:46:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:53,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:46:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:53,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-18 20:46:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-18 20:46:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837712343] [2022-11-18 20:46:53,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837712343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:53,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:53,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-18 20:46:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502333109] [2022-11-18 20:46:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:53,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:46:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:53,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:46:53,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:46:53,630 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.2) internal successors, (64), 17 states have internal predecessors, (64), 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-18 20:46:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:56,955 INFO L93 Difference]: Finished difference Result 190 states and 228 transitions. [2022-11-18 20:46:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:46:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.2) internal successors, (64), 17 states have internal predecessors, (64), 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 132 [2022-11-18 20:46:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:56,957 INFO L225 Difference]: With dead ends: 190 [2022-11-18 20:46:56,958 INFO L226 Difference]: Without dead ends: 144 [2022-11-18 20:46:56,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-11-18 20:46:56,959 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 136 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:56,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 908 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 20:46:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-18 20:46:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2022-11-18 20:46:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-18 20:46:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2022-11-18 20:46:56,984 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 132 [2022-11-18 20:46:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:56,986 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2022-11-18 20:46:56,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.2) internal successors, (64), 17 states have internal predecessors, (64), 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-18 20:46:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2022-11-18 20:46:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-18 20:46:56,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:56,995 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:56,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:46:56,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1929836520, now seen corresponding path program 1 times [2022-11-18 20:46:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803937011] [2022-11-18 20:46:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:46:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:46:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:46:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:46:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:46:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:46:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:46:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:46:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:46:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-18 20:46:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:46:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803937011] [2022-11-18 20:46:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803937011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:46:57,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:46:57,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:46:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820351580] [2022-11-18 20:46:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:46:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:46:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:46:57,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:46:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:46:57,786 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 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-18 20:46:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:59,126 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2022-11-18 20:46:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:46:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 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 138 [2022-11-18 20:46:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:59,128 INFO L225 Difference]: With dead ends: 225 [2022-11-18 20:46:59,128 INFO L226 Difference]: Without dead ends: 120 [2022-11-18 20:46:59,128 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-18 20:46:59,129 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 105 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:59,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 407 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 20:46:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-18 20:46:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-18 20:46:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:46:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2022-11-18 20:46:59,148 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 138 [2022-11-18 20:46:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:59,149 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2022-11-18 20:46:59,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 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-18 20:46:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2022-11-18 20:46:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-18 20:46:59,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:59,151 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:46:59,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:46:59,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:46:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:59,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1108978750, now seen corresponding path program 1 times [2022-11-18 20:46:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:46:59,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924819761] [2022-11-18 20:46:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:46:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:46:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:46:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:46:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:46:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:46:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:46:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:46:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:46:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:46:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:46:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:46:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:46:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:46:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:46:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:46:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:47:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:47:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-18 20:47:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:00,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924819761] [2022-11-18 20:47:00,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924819761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:47:00,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:47:00,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:47:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524137975] [2022-11-18 20:47:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:47:00,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:47:00,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:00,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:47:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:47:00,129 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 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-18 20:47:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:01,100 INFO L93 Difference]: Finished difference Result 166 states and 195 transitions. [2022-11-18 20:47:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:47:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 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 133 [2022-11-18 20:47:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:01,103 INFO L225 Difference]: With dead ends: 166 [2022-11-18 20:47:01,103 INFO L226 Difference]: Without dead ends: 121 [2022-11-18 20:47:01,103 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-18 20:47:01,104 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 172 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:01,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 162 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 20:47:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-18 20:47:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-18 20:47:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:47:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2022-11-18 20:47:01,118 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 133 [2022-11-18 20:47:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:01,119 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2022-11-18 20:47:01,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 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-18 20:47:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2022-11-18 20:47:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-18 20:47:01,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:01,121 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:01,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:47:01,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:47:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1489473318, now seen corresponding path program 1 times [2022-11-18 20:47:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393309097] [2022-11-18 20:47:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:47:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:47:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:47:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:47:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:47:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:47:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:47:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:47:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:47:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:47:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:47:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:47:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:47:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:47:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-18 20:47:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 20:47:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393309097] [2022-11-18 20:47:07,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393309097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:47:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289201076] [2022-11-18 20:47:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:47:07,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:47:07,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:47:08,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:47:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:08,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-18 20:47:08,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:47:10,092 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-18 20:47:10,354 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| Int) (v_ArrVal_773 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (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_5_66| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_773)) |c_#memory_int|)))) is different from true [2022-11-18 20:47:10,559 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| Int) (v_ArrVal_773 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_5| Int) (v_ArrVal_777 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_5|) (= (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_5_66| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_773) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_5| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_777)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_5_66| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))))) is different from true [2022-11-18 20:47:10,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:10,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:10,685 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2022-11-18 20:47:10,686 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 31 treesize of output 42 [2022-11-18 20:47:10,843 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2022-11-18 20:47:10,869 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-18 20:47:10,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 113 [2022-11-18 20:47:10,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 3 [2022-11-18 20:47:12,278 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-18 20:47:12,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 209 treesize of output 132 [2022-11-18 20:47:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 2 not checked. [2022-11-18 20:47:12,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:47:21,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289201076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:47:21,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:47:21,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 37] total 59 [2022-11-18 20:47:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971387244] [2022-11-18 20:47:21,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:47:21,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-18 20:47:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-18 20:47:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=4122, Unknown=2, NotChecked=258, Total=4556 [2022-11-18 20:47:21,022 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand has 59 states, 50 states have (on average 2.2) internal successors, (110), 40 states have internal predecessors, (110), 18 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (41), 24 states have call predecessors, (41), 15 states have call successors, (41) [2022-11-18 20:47:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:30,092 INFO L93 Difference]: Finished difference Result 175 states and 207 transitions. [2022-11-18 20:47:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 20:47:30,093 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 50 states have (on average 2.2) internal successors, (110), 40 states have internal predecessors, (110), 18 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (41), 24 states have call predecessors, (41), 15 states have call successors, (41) Word has length 134 [2022-11-18 20:47:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:30,094 INFO L225 Difference]: With dead ends: 175 [2022-11-18 20:47:30,094 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:47:30,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=440, Invalid=9266, Unknown=4, NotChecked=390, Total=10100 [2022-11-18 20:47:30,099 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 183 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 4172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 508 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:30,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1143 Invalid, 4172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 3515 Invalid, 0 Unknown, 508 Unchecked, 4.2s Time] [2022-11-18 20:47:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:47:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-11-18 20:47:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:47:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2022-11-18 20:47:30,119 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 134 [2022-11-18 20:47:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:30,120 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2022-11-18 20:47:30,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 50 states have (on average 2.2) internal successors, (110), 40 states have internal predecessors, (110), 18 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (41), 24 states have call predecessors, (41), 15 states have call successors, (41) [2022-11-18 20:47:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2022-11-18 20:47:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-18 20:47:30,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:30,123 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:47:30,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:47:30,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:47:30,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:47:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 982362820, now seen corresponding path program 2 times [2022-11-18 20:47:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:47:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211962255] [2022-11-18 20:47:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:47:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:47:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:47:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:47:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:47:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:47:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:47:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:47:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:47:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:47:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:47:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:47:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:47:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:47:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:47:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:47:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:47:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:47:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-18 20:47:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:47:35,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211962255] [2022-11-18 20:47:35,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211962255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:47:35,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047255065] [2022-11-18 20:47:35,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:47:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:47:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:47:35,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:47:35,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:47:35,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:47:35,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:47:35,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 3033 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-18 20:47:35,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:47:36,778 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-18 20:47:36,962 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1262 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_12| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_12|) (= (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_12| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1262)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_12| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-18 20:47:36,980 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1262 Int) (v_ArrVal_1266 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_13| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_12| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_12|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_12| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_13|) (= (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_12| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1262) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_13| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1266)) |c_#memory_int|))) is different from true [2022-11-18 20:47:37,144 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1270 Int) (v_ArrVal_1262 Int) (v_ArrVal_1266 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_13| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_12| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_12| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_12|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_12|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_12| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_13|) (= |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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_12| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1262) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_13| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1266) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_12| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1270))))) is different from true [2022-11-18 20:47:37,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:37,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:37,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:37,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:37,248 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-18 20:47:37,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-11-18 20:47:37,290 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:47:37,291 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 34 treesize of output 30 [2022-11-18 20:47:38,362 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-18 20:47:38,363 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 93 treesize of output 59 [2022-11-18 20:47:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 71 trivial. 4 not checked. [2022-11-18 20:47:38,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:47:51,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047255065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:47:51,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:47:51,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 37] total 56 [2022-11-18 20:47:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821398047] [2022-11-18 20:47:51,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:47:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-18 20:47:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:47:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-18 20:47:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3634, Unknown=3, NotChecked=366, Total=4160 [2022-11-18 20:47:51,765 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 56 states, 50 states have (on average 2.32) internal successors, (116), 41 states have internal predecessors, (116), 15 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (40), 21 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-18 20:48:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:01,748 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2022-11-18 20:48:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:48:01,749 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 50 states have (on average 2.32) internal successors, (116), 41 states have internal predecessors, (116), 15 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (40), 21 states have call predecessors, (40), 13 states have call successors, (40) Word has length 135 [2022-11-18 20:48:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:01,750 INFO L225 Difference]: With dead ends: 175 [2022-11-18 20:48:01,750 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:48:01,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=402, Invalid=8346, Unknown=6, NotChecked=558, Total=9312 [2022-11-18 20:48:01,754 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 184 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 4033 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 5049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 4033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:01,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1391 Invalid, 5049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 4033 Invalid, 0 Unknown, 856 Unchecked, 4.9s Time] [2022-11-18 20:48:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:48:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-11-18 20:48:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:48:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2022-11-18 20:48:01,770 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 135 [2022-11-18 20:48:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:01,771 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2022-11-18 20:48:01,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 50 states have (on average 2.32) internal successors, (116), 41 states have internal predecessors, (116), 15 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (40), 21 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-18 20:48:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-11-18 20:48:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-18 20:48:01,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:01,773 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:48:01,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:48:01,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:48:01,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:48:01,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:01,985 INFO L85 PathProgramCache]: Analyzing trace with hash 299871770, now seen corresponding path program 3 times [2022-11-18 20:48:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:01,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490058263] [2022-11-18 20:48:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:48:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:48:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:48:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:48:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:48:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:48:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:48:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:48:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:48:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:48:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:48:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:48:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:48:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:48:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:48:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:48:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-18 20:48:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490058263] [2022-11-18 20:48:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490058263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:48:07,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080220075] [2022-11-18 20:48:07,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:48:07,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:48:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:48:07,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:48:07,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:48:18,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:48:18,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:48:18,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-18 20:48:18,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:18,535 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-18 20:48:19,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-11-18 20:48:19,658 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:48:19,659 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-18 20:48:20,872 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-18 20:48:20,873 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-18 20:48:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-18 20:48:21,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:23,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080220075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:48:23,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:48:23,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2022-11-18 20:48:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82308407] [2022-11-18 20:48:23,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:48:23,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-18 20:48:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:23,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-18 20:48:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3989, Unknown=2, NotChecked=0, Total=4160 [2022-11-18 20:48:23,978 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 56 states, 50 states have (on average 2.24) internal successors, (112), 41 states have internal predecessors, (112), 14 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (39), 18 states have call predecessors, (39), 12 states have call successors, (39) [2022-11-18 20:48:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:30,087 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2022-11-18 20:48:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:48:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 50 states have (on average 2.24) internal successors, (112), 41 states have internal predecessors, (112), 14 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (39), 18 states have call predecessors, (39), 12 states have call successors, (39) Word has length 136 [2022-11-18 20:48:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:30,089 INFO L225 Difference]: With dead ends: 174 [2022-11-18 20:48:30,089 INFO L226 Difference]: Without dead ends: 124 [2022-11-18 20:48:30,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=388, Invalid=8166, Unknown=2, NotChecked=0, Total=8556 [2022-11-18 20:48:30,093 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:30,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1278 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3108 Invalid, 0 Unknown, 454 Unchecked, 4.1s Time] [2022-11-18 20:48:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-18 20:48:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-18 20:48:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:48:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2022-11-18 20:48:30,110 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 136 [2022-11-18 20:48:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:30,111 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2022-11-18 20:48:30,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 50 states have (on average 2.24) internal successors, (112), 41 states have internal predecessors, (112), 14 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (39), 18 states have call predecessors, (39), 12 states have call successors, (39) [2022-11-18 20:48:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2022-11-18 20:48:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-18 20:48:30,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:30,115 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:30,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:48:30,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:48:30,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:48:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash 617485700, now seen corresponding path program 4 times [2022-11-18 20:48:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:48:30,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888873352] [2022-11-18 20:48:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:48:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:48:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:48:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:48:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:48:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:48:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:48:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:48:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:48:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:48:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:48:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:48:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:48:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:48:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:48:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:48:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:48:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-18 20:48:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-18 20:48:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:48:34,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888873352] [2022-11-18 20:48:34,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888873352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:48:34,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231175139] [2022-11-18 20:48:34,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:48:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:48:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:48:34,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:48:34,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:48:35,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:48:35,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:48:35,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 3295 conjuncts, 162 conjunts are in the unsatisfiable core [2022-11-18 20:48:35,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:37,353 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-18 20:48:38,066 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2791 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_2791)))))) is different from true [2022-11-18 20:48:38,100 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2791 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_33| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (v_ArrVal_2796 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| 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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_2791) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2796)) |c_#memory_int|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_33|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|)))) is different from true [2022-11-18 20:48:38,154 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2791 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_33| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (v_ArrVal_2796 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_34| Int) (v_ArrVal_2800 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|))) (and (= |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_32_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_2791) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2796) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_34| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2800))) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_34|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_33|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_34| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|)))) is different from true [2022-11-18 20:48:38,209 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2791 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_33| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (v_ArrVal_2796 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_35| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_34| Int) (v_ArrVal_2800 Int) (v_ArrVal_2802 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_34|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_33|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0)) (= (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_32_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_2791) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2796) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_34| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2800) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_35| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2802)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_34| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_35|)))) is different from true [2022-11-18 20:48:38,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2791 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_33| Int) (v_ArrVal_2806 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (v_ArrVal_2796 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_35| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_24| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_34| Int) (v_ArrVal_2800 Int) (v_ArrVal_2802 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_34|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_2791) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_33| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2796) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_34| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2800) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_35| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2802) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_24| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2806))) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_33|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_32_67|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_24|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_34| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_35|)))) is different from true [2022-11-18 20:48:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:38,877 INFO L321 Elim1Store]: treesize reduction 63, result has 48.8 percent of original size [2022-11-18 20:48:38,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 81 [2022-11-18 20:48:39,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 82 [2022-11-18 20:48:39,132 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-18 20:48:39,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2022-11-18 20:48:39,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 3 [2022-11-18 20:48:44,949 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-18 20:48:44,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 127 [2022-11-18 20:48:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 74 trivial. 11 not checked. [2022-11-18 20:48:45,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:52,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_aws_string_new_from_array_~len 18446744073709551616))) (let ((.cse5 (+ c_aws_string_new_from_array_~str~2.offset 8)) (.cse6 (select |c_#memory_int| c_aws_string_new_from_array_~str~2.base)) (.cse8 (+ c_aws_string_new_from_array_~str~2.offset 16)) (.cse0 (<= .cse1 9223372036854775807))) (and (or .cse0 (let ((.cse7 (+ c_aws_string_new_from_array_~str~2.offset .cse1 (- 18446744073709551600)))) (and (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (or (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_48| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_48|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_29| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_29|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_50| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_50|)) (forall ((|v_#Ultimate.C_memcpy_dest.offset_15| Int)) (or (forall ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (let ((.cse2 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (or (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse2 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|)) (not (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse2))) (forall ((v_ArrVal_2832 Int) (v_ArrVal_2834 Int) (v_ArrVal_2833 Int) (v_ArrVal_2836 Int) (v_ArrVal_2835 Int)) (let ((.cse3 (store (store (store (store (store (store .cse6 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| |v_#Ultimate.C_memcpy_dest.offset_15| .cse2) v_ArrVal_2833) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) v_ArrVal_2835) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_48|) v_ArrVal_2832) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_50|) v_ArrVal_2836) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1325_29|) v_ArrVal_2834) .cse7 0))) (let ((.cse4 (mod (select .cse3 .cse5) 18446744073709551616))) (or (= (mod (select .cse3 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse4)) 256) 0) (not (<= .cse4 9223372036854775807))))))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_15|)))))))))))) (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_48| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_48|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_29| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_29|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_50| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_50|)) (forall ((|v_#Ultimate.C_memcpy_dest.offset_15| Int)) (or (forall ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (let ((.cse9 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (or (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse9 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|)) (not (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse9))) (forall ((v_ArrVal_2832 Int) (v_ArrVal_2834 Int) (v_ArrVal_2833 Int) (v_ArrVal_2836 Int) (v_ArrVal_2835 Int)) (let ((.cse10 (store (store (store (store (store (store .cse6 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| |v_#Ultimate.C_memcpy_dest.offset_15| .cse9) v_ArrVal_2833) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) v_ArrVal_2835) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_48|) v_ArrVal_2832) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_50|) v_ArrVal_2836) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1325_29|) v_ArrVal_2834) .cse7 0))) (let ((.cse11 (mod (select .cse10 .cse5) 18446744073709551616))) (or (= (mod (select .cse10 (+ c_aws_string_new_from_array_~str~2.offset (- 18446744073709551600) .cse11)) 256) 0) (<= .cse11 9223372036854775807)))))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_15|)))))))))) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_48| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_29| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_29|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_50| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_15| Int)) (or (forall ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (let ((.cse14 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (or (forall ((v_ArrVal_2832 Int) (v_ArrVal_2834 Int) (v_ArrVal_2833 Int) (v_ArrVal_2836 Int) (v_ArrVal_2835 Int)) (let ((.cse12 (store (store (store (store (store (store .cse6 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| |v_#Ultimate.C_memcpy_dest.offset_15| .cse14) v_ArrVal_2833) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) v_ArrVal_2835) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_48|) v_ArrVal_2832) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_50|) v_ArrVal_2836) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1325_29|) v_ArrVal_2834) .cse7 0))) (let ((.cse13 (mod (select .cse12 .cse5) 18446744073709551616))) (or (= (mod (select .cse12 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse13)) 256) 0) (= (mod (select .cse12 (+ c_aws_string_new_from_array_~str~2.offset (- 18446744073709551600) .cse13)) 256) 0))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse14 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|)) (not (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse14)))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_15|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_50|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_48|)))) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|)))))) (or (let ((.cse18 (+ c_aws_string_new_from_array_~str~2.offset .cse1 16))) (and (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (or (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_48| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_48|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_29| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_29|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_50| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_50|)) (forall ((|v_#Ultimate.C_memcpy_dest.offset_15| Int)) (or (forall ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (let ((.cse17 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (or (forall ((v_ArrVal_2832 Int) (v_ArrVal_2834 Int) (v_ArrVal_2833 Int) (v_ArrVal_2836 Int) (v_ArrVal_2835 Int)) (let ((.cse15 (store (store (store (store (store (store .cse6 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| |v_#Ultimate.C_memcpy_dest.offset_15| .cse17) v_ArrVal_2833) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) v_ArrVal_2835) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_48|) v_ArrVal_2832) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_50|) v_ArrVal_2836) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1325_29|) v_ArrVal_2834) .cse18 0))) (let ((.cse16 (mod (select .cse15 .cse5) 18446744073709551616))) (or (= (mod (select .cse15 (+ c_aws_string_new_from_array_~str~2.offset .cse16 (- 18446744073709551600))) 256) 0) (<= .cse16 9223372036854775807))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse17 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|)) (not (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse17)))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_15|)))))))))))) (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (or (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_48| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_48|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_29| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_50| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_15| Int)) (or (forall ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (let ((.cse19 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (or (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse19 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|)) (forall ((v_ArrVal_2832 Int) (v_ArrVal_2834 Int) (v_ArrVal_2833 Int) (v_ArrVal_2836 Int) (v_ArrVal_2835 Int)) (let ((.cse21 (store (store (store (store (store (store .cse6 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| |v_#Ultimate.C_memcpy_dest.offset_15| .cse19) v_ArrVal_2833) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) v_ArrVal_2835) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_48|) v_ArrVal_2832) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_50|) v_ArrVal_2836) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1325_29|) v_ArrVal_2834) .cse18 0))) (let ((.cse20 (mod (select .cse21 .cse5) 18446744073709551616))) (or (not (<= .cse20 9223372036854775807)) (= (mod (select .cse21 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse20)) 256) 0))))) (not (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse19)))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_15|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_50|)))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_29|)))))))) (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (or (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_49| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_48| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_29| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_50| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_15| Int)) (or (forall ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| Int)) (let ((.cse24 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67|))) (or (forall ((v_ArrVal_2832 Int) (v_ArrVal_2834 Int) (v_ArrVal_2833 Int) (v_ArrVal_2836 Int) (v_ArrVal_2835 Int)) (let ((.cse22 (store (store (store (store (store (store .cse6 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| |v_#Ultimate.C_memcpy_dest.offset_15| .cse24) v_ArrVal_2833) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_49|) v_ArrVal_2835) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_48|) v_ArrVal_2832) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1316_50|) v_ArrVal_2836) (+ |v_#Ultimate.C_memcpy_dest.offset_15| |v_#Ultimate.C_memcpy_#t~loopctr1325_29|) v_ArrVal_2834) .cse18 0))) (let ((.cse23 (mod (select .cse22 .cse5) 18446744073709551616))) (or (= (mod (select .cse22 (+ c_aws_string_new_from_array_~str~2.offset .cse23 (- 18446744073709551600))) 256) 0) (= (mod (select .cse22 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse23)) 256) 0))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse24 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_49|)) (not (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_46_67| .cse24)))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_15|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_48| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_50|)))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_29|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_49| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_48|)))))))) (not .cse0))))) is different from false [2022-11-18 20:48:52,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231175139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:48:52,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:48:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 46] total 67 [2022-11-18 20:48:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778723497] [2022-11-18 20:48:52,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:48:52,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-18 20:48:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:48:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-18 20:48:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=4666, Unknown=7, NotChecked=846, Total=5700 [2022-11-18 20:48:52,968 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 67 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 49 states have internal predecessors, (124), 19 states have call successors, (44), 10 states have call predecessors, (44), 15 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) [2022-11-18 20:49:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:04,040 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2022-11-18 20:49:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-18 20:49:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 49 states have internal predecessors, (124), 19 states have call successors, (44), 10 states have call predecessors, (44), 15 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) Word has length 137 [2022-11-18 20:49:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:04,042 INFO L225 Difference]: With dead ends: 176 [2022-11-18 20:49:04,042 INFO L226 Difference]: Without dead ends: 126 [2022-11-18 20:49:04,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=445, Invalid=10698, Unknown=11, NotChecked=1278, Total=12432 [2022-11-18 20:49:04,048 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 184 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 3134 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 5202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 3134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1917 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:04,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1984 Invalid, 5202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 3134 Invalid, 0 Unknown, 1917 Unchecked, 4.2s Time] [2022-11-18 20:49:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-18 20:49:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-11-18 20:49:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:49:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2022-11-18 20:49:04,071 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 137 [2022-11-18 20:49:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:04,072 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2022-11-18 20:49:04,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 49 states have internal predecessors, (124), 19 states have call successors, (44), 10 states have call predecessors, (44), 15 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) [2022-11-18 20:49:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2022-11-18 20:49:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-18 20:49:04,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:04,074 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:49:04,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:04,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:04,287 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:49:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1873582938, now seen corresponding path program 5 times [2022-11-18 20:49:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:04,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778000358] [2022-11-18 20:49:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:49:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:49:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:49:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:49:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:49:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:49:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:49:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:49:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:49:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:49:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:49:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:08,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:49:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:49:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:49:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 21 proven. 40 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-18 20:49:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:10,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778000358] [2022-11-18 20:49:10,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778000358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:10,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110376897] [2022-11-18 20:49:10,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:49:10,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:10,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:10,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:49:35,499 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-18 20:49:35,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:49:35,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-18 20:49:35,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:36,395 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-18 20:49:36,613 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3832 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_51| Int)) (and (= (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_51| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3832)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_51|))) is different from true [2022-11-18 20:49:36,630 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3836 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_52| Int) (v_ArrVal_3832 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_51| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_52|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_51|) (= |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_51| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3832) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3836))))) is different from true [2022-11-18 20:49:36,675 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3836 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_52| Int) (v_ArrVal_3837 Int) (v_ArrVal_3832 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_51| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_52|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_51|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 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_51| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3832) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3836) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3837)) |c_#memory_int|)))) is different from true [2022-11-18 20:49:36,728 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3836 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_52| Int) (v_ArrVal_3837 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_54| Int) (v_ArrVal_3832 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_51| Int) (v_ArrVal_3842 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_52|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_54| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_51|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3832) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3836) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3837) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_54| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3842)))))) is different from true [2022-11-18 20:49:36,808 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3836 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_52| Int) (v_ArrVal_3837 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_55| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_54| Int) (v_ArrVal_3846 Int) (v_ArrVal_3832 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_51| Int) (v_ArrVal_3842 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_52|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_54| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_55|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_51|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3832) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3836) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3837) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_54| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3842) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_55| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3846)))))) is different from true [2022-11-18 20:49:37,194 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3836 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_31| Int) (v_ArrVal_3837 Int) (v_ArrVal_3846 Int) (v_ArrVal_3832 Int) (v_ArrVal_3842 Int) (v_ArrVal_3850 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_52| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_55| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_54| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_51| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_51| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_52|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_31|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_54| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_55|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0)) (= (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_51| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3832) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3836) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_53_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3837) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_54| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3842) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_55| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3846) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_31| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3850)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_51|)))) is different from true [2022-11-18 20:49:37,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,493 INFO L321 Elim1Store]: treesize reduction 77, result has 48.7 percent of original size [2022-11-18 20:49:37,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 94 [2022-11-18 20:49:37,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2022-11-18 20:49:37,668 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-18 20:49:37,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 113 [2022-11-18 20:49:37,708 INFO L321 Elim1Store]: treesize reduction 118, result has 7.1 percent of original size [2022-11-18 20:49:37,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 79 [2022-11-18 20:49:38,972 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-18 20:49:38,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 222 treesize of output 137 [2022-11-18 20:49:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 74 trivial. 16 not checked. [2022-11-18 20:49:39,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:20,240 WARN L233 SmtUtils]: Spent 16.64s on a formula simplification. DAG size of input: 195 DAG size of output: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:50:20,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110376897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:20,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:50:20,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38] total 62 [2022-11-18 20:50:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177138490] [2022-11-18 20:50:20,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:20,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-18 20:50:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-18 20:50:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=4000, Unknown=9, NotChecked=786, Total=4970 [2022-11-18 20:50:20,249 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand has 62 states, 56 states have (on average 2.017857142857143) internal successors, (113), 47 states have internal predecessors, (113), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (36), 19 states have call predecessors, (36), 12 states have call successors, (36) [2022-11-18 20:50:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:33,978 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2022-11-18 20:50:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-18 20:50:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 56 states have (on average 2.017857142857143) internal successors, (113), 47 states have internal predecessors, (113), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (36), 19 states have call predecessors, (36), 12 states have call successors, (36) Word has length 138 [2022-11-18 20:50:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:33,980 INFO L225 Difference]: With dead ends: 174 [2022-11-18 20:50:33,980 INFO L226 Difference]: Without dead ends: 129 [2022-11-18 20:50:33,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 151 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=415, Invalid=9492, Unknown=17, NotChecked=1206, Total=11130 [2022-11-18 20:50:33,984 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 119 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 5037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1163 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:33,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1413 Invalid, 5037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3791 Invalid, 0 Unknown, 1163 Unchecked, 5.6s Time] [2022-11-18 20:50:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-18 20:50:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-11-18 20:50:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.0875) internal successors, (87), 81 states have internal predecessors, (87), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:50:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-11-18 20:50:34,025 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 138 [2022-11-18 20:50:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:34,026 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-11-18 20:50:34,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 56 states have (on average 2.017857142857143) internal successors, (113), 47 states have internal predecessors, (113), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (36), 19 states have call predecessors, (36), 12 states have call successors, (36) [2022-11-18 20:50:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-11-18 20:50:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-18 20:50:34,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:34,030 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:34,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:34,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:50:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2137075644, now seen corresponding path program 6 times [2022-11-18 20:50:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:34,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738554108] [2022-11-18 20:50:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:50:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:50:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:50:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:50:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:50:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:50:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:50:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:50:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:50:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:50:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:50:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:50:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:50:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-18 20:50:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738554108] [2022-11-18 20:50:40,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738554108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642944615] [2022-11-18 20:50:40,541 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:50:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:40,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:40,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:51:11,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-18 20:51:11,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:51:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 3557 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-18 20:51:12,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:51:12,770 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-18 20:51:13,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_75| Int) (v_ArrVal_5058 Int) (v_ArrVal_5054 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_5054) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5058)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_75|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-18 20:51:13,166 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_75| Int) (v_ArrVal_5064 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_76| Int) (v_ArrVal_5058 Int) (v_ArrVal_5054 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_76|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_75|) (= |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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_5054) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5058) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5064))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-18 20:51:13,202 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_75| Int) (v_ArrVal_5064 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_77| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_76| Int) (v_ArrVal_5058 Int) (v_ArrVal_5054 Int) (v_ArrVal_5065 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_76|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_75|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_77|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_77| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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_5054) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5058) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5064) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_77| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5065)) |c_#memory_int|)))) is different from true [2022-11-18 20:51:13,246 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_75| Int) (v_ArrVal_5064 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_77| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_76| Int) (v_ArrVal_5058 Int) (v_ArrVal_5069 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (v_ArrVal_5054 Int) (v_ArrVal_5065 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_76|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_75|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_77|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_5054) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5058) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5064) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_77| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5065) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5069))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_77| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|)))) is different from true [2022-11-18 20:51:13,301 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_75| Int) (v_ArrVal_5064 Int) (v_ArrVal_5075 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_77| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_76| Int) (v_ArrVal_5058 Int) (v_ArrVal_5069 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (v_ArrVal_5054 Int) (v_ArrVal_5065 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_76|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_75|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_77|) (= (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_5054) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_75| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5058) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_76| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5064) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_77| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5065) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5069) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5075)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_77| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-18 20:51:14,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:14,409 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 58 treesize of output 72 [2022-11-18 20:51:14,554 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:51:14,554 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-18 20:51:15,940 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-18 20:51:15,940 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-18 20:51:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 83 trivial. 20 not checked. [2022-11-18 20:51:16,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:51:30,868 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 103 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:51:30,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642944615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:51:30,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:51:30,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 40] total 65 [2022-11-18 20:51:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218713552] [2022-11-18 20:51:30,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:51:30,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-18 20:51:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-18 20:51:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=4521, Unknown=8, NotChecked=690, Total=5402 [2022-11-18 20:51:30,874 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 65 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 50 states have internal predecessors, (115), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (35), 19 states have call predecessors, (35), 12 states have call successors, (35) [2022-11-18 20:51:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:49,546 INFO L93 Difference]: Finished difference Result 179 states and 211 transitions. [2022-11-18 20:51:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-18 20:51:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 50 states have internal predecessors, (115), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (35), 19 states have call predecessors, (35), 12 states have call successors, (35) Word has length 139 [2022-11-18 20:51:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:49,549 INFO L225 Difference]: With dead ends: 179 [2022-11-18 20:51:49,549 INFO L226 Difference]: Without dead ends: 132 [2022-11-18 20:51:49,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=442, Invalid=10695, Unknown=13, NotChecked=1060, Total=12210 [2022-11-18 20:51:49,552 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 5346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1277 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:49,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1531 Invalid, 5346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3954 Invalid, 0 Unknown, 1277 Unchecked, 5.4s Time] [2022-11-18 20:51:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-18 20:51:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2022-11-18 20:51:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 83 states have internal predecessors, (90), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:51:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2022-11-18 20:51:49,590 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 139 [2022-11-18 20:51:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:49,590 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2022-11-18 20:51:49,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 50 states have internal predecessors, (115), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (35), 19 states have call predecessors, (35), 12 states have call successors, (35) [2022-11-18 20:51:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2022-11-18 20:51:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-18 20:51:49,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:49,592 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:49,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:51:49,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:51:49,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:51:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 775625794, now seen corresponding path program 7 times [2022-11-18 20:51:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:49,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864075891] [2022-11-18 20:51:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:51:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:51:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:51:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:51:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:51:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:51:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:51:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:51:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:51:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:51:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:51:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:51:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:51:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:51:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:51:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:51:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:51:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:51:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:51:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:51:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:50,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:51:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:51:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-18 20:51:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:51,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864075891] [2022-11-18 20:51:51,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864075891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:51:51,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282522957] [2022-11-18 20:51:51,251 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:51:51,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:51:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:51,252 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:51:51,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:51:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:52,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-18 20:51:52,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:51:53,123 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-18 20:51:53,302 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-18 20:51:53,334 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_100| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6144 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_100|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6144)) |c_#memory_int|)))) is different from true [2022-11-18 20:51:53,376 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_100| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_101| Int) (v_ArrVal_6147 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6144 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (= |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|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6144) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6147))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_101|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_100|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-18 20:51:53,432 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (v_ArrVal_6149 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_100| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_101| Int) (v_ArrVal_6147 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_102| Int) (v_ArrVal_6144 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_101|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_102|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6144) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6147) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6149)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_100|)))) is different from true [2022-11-18 20:51:53,510 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6153 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (v_ArrVal_6149 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_100| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_101| Int) (v_ArrVal_6147 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_102| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_103| Int) (v_ArrVal_6144 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_103|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_101|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6144) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6147) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6149) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6153)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_102|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_100|)))) is different from true [2022-11-18 20:51:53,885 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (v_ArrVal_6149 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_100| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_101| Int) (v_ArrVal_6147 Int) (v_ArrVal_6158 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_102| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_103| Int) (v_ArrVal_6144 Int) (v_ArrVal_6153 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_43| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_103|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_101|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_102|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_100|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6144) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6147) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6149) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6153) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6158)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_43|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_43| 8) |c_#Ultimate.C_memcpy_#t~loopctr1325|)))) is different from true [2022-11-18 20:51:54,008 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (v_ArrVal_6138 Int) (v_ArrVal_6149 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_100| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_101| Int) (v_ArrVal_6147 Int) (v_ArrVal_6158 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_102| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_103| Int) (v_ArrVal_6144 Int) (v_ArrVal_6153 Int) (v_ArrVal_6160 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_43| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|))) (and (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_103|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_101|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_102|) (= (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|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6138) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_100| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6144) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6147) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6149) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6153) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6158) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6160)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_99_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_100|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_43|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_43| 8) |v_#Ultimate.C_memcpy_#t~loopctr1325_44|)))) is different from true [2022-11-18 20:51:54,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:51:54,464 INFO L321 Elim1Store]: treesize reduction 173, result has 34.7 percent of original size [2022-11-18 20:51:54,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 122 [2022-11-18 20:51:54,592 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:51:54,592 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 45 treesize of output 35 [2022-11-18 20:51:55,613 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-18 20:51:55,613 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 111 treesize of output 69 [2022-11-18 20:51:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 18 not checked. [2022-11-18 20:51:55,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:52:38,536 WARN L233 SmtUtils]: Spent 13.29s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:52:38,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282522957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:38,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:52:38,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 42] total 54 [2022-11-18 20:52:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589628413] [2022-11-18 20:52:38,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:52:38,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-18 20:52:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:38,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-18 20:52:38,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2938, Unknown=11, NotChecked=798, Total=3906 [2022-11-18 20:52:38,547 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand has 54 states, 48 states have (on average 2.375) internal successors, (114), 38 states have internal predecessors, (114), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2022-11-18 20:52:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:54,358 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2022-11-18 20:52:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-18 20:52:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 48 states have (on average 2.375) internal successors, (114), 38 states have internal predecessors, (114), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) Word has length 139 [2022-11-18 20:52:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:54,360 INFO L225 Difference]: With dead ends: 179 [2022-11-18 20:52:54,360 INFO L226 Difference]: Without dead ends: 131 [2022-11-18 20:52:54,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=348, Invalid=6631, Unknown=21, NotChecked=1190, Total=8190 [2022-11-18 20:52:54,369 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 143 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 2904 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 4449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1426 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:54,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1177 Invalid, 4449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2904 Invalid, 0 Unknown, 1426 Unchecked, 3.7s Time] [2022-11-18 20:52:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-18 20:52:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-11-18 20:52:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 83 states have internal predecessors, (89), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:52:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2022-11-18 20:52:54,394 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 139 [2022-11-18 20:52:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:54,394 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2022-11-18 20:52:54,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 48 states have (on average 2.375) internal successors, (114), 38 states have internal predecessors, (114), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2022-11-18 20:52:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-11-18 20:52:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-18 20:52:54,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:54,396 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:54,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:54,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:52:54,610 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1913440102, now seen corresponding path program 8 times [2022-11-18 20:52:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:54,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340325389] [2022-11-18 20:52:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:52:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:52:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:52:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:52:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:52:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:52:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:52:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:52:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:52:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:52:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:52:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:52:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:52:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:52:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:52:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:52:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:52:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:52:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:52:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:52:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-18 20:52:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-18 20:52:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:59,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340325389] [2022-11-18 20:52:59,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340325389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:59,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395743759] [2022-11-18 20:52:59,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:52:59,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:59,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:59,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:52:59,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:53:00,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:53:00,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:53:00,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 3688 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-18 20:53:00,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:53:57,144 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-18 20:53:59,511 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7542 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (= |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_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542))) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))))) is different from true [2022-11-18 20:53:59,545 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (v_ArrVal_7542 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (= (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_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))))) is different from true [2022-11-18 20:53:59,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_124| Int) (v_ArrVal_7542 Int) (v_ArrVal_7551 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (= |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_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7551))) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_124|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-18 20:53:59,650 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (v_ArrVal_7555 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_124| Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_125| Int) (v_ArrVal_7551 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (= (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_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7551) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7555)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_124|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_125|)))) is different from true [2022-11-18 20:53:59,731 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7560 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (v_ArrVal_7555 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_124| Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_125| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_126| Int) (v_ArrVal_7551 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_126|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_124|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_125|) (= (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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7551) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7555) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7560)) |c_#memory_int|)))) is different from true [2022-11-18 20:53:59,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (v_ArrVal_7555 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_124| Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_125| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_126| Int) (v_ArrVal_7551 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_127| Int) (v_ArrVal_7562 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7560 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_127| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_126|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_127|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_124|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_125|) (= (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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7551) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7555) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7560) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_127| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7562)) |c_#memory_int|)))) is different from true [2022-11-18 20:54:00,005 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_128| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (v_ArrVal_7555 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_124| Int) (v_ArrVal_7565 Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_125| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_126| Int) (v_ArrVal_7551 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_127| Int) (v_ArrVal_7562 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7560 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_126|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_127| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_128|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_127|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7551) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7555) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7560) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_127| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7562) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_128| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7565))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_124|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_125|)))) is different from true [2022-11-18 20:54:06,770 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_128| Int) (v_ArrVal_7569 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7546 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_123| Int) (v_ArrVal_7555 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_124| Int) (v_ArrVal_7565 Int) (v_ArrVal_7542 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_125| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_126| Int) (v_ArrVal_7551 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_127| Int) (v_ArrVal_7562 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| Int) (v_ArrVal_7560 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_54| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|))) (and (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_123|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_126|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_127| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_128|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_127|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_122_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_7542) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7546) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7551) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_125| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7555) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_126| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7560) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_127| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7562) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_128| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7565) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_54| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7569)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_123| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_124|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_124| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_125|)))) is different from true [2022-11-18 20:54:07,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:54:07,366 INFO L321 Elim1Store]: treesize reduction 105, result has 48.5 percent of original size [2022-11-18 20:54:07,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 29 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 120 [2022-11-18 20:54:09,738 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 82 [2022-11-18 20:54:09,767 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-18 20:54:09,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2022-11-18 20:54:09,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 3 [2022-11-18 20:54:31,868 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-18 20:54:31,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 189 treesize of output 122 [2022-11-18 20:54:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 83 trivial. 29 not checked. [2022-11-18 20:54:32,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:54:53,419 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 20:56:28,481 WARN L233 SmtUtils]: Spent 23.80s on a formula simplification that was a NOOP. DAG size: 221 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:56:28,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395743759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:56:28,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:56:28,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 40] total 66 [2022-11-18 20:56:28,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623556665] [2022-11-18 20:56:28,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:56:28,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-18 20:56:28,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:56:28,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-18 20:56:28,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=4201, Unknown=71, NotChecked=1096, Total=5550 [2022-11-18 20:56:28,491 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 66 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 51 states have internal predecessors, (125), 14 states have call successors, (43), 10 states have call predecessors, (43), 13 states have return successors, (40), 19 states have call predecessors, (40), 12 states have call successors, (40) [2022-11-18 20:58:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:58:33,121 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2022-11-18 20:58:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-18 20:58:33,122 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 51 states have internal predecessors, (125), 14 states have call successors, (43), 10 states have call predecessors, (43), 13 states have return successors, (40), 19 states have call predecessors, (40), 12 states have call successors, (40) Word has length 140 [2022-11-18 20:58:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:58:33,123 INFO L225 Difference]: With dead ends: 181 [2022-11-18 20:58:33,123 INFO L226 Difference]: Without dead ends: 136 [2022-11-18 20:58:33,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 311.9s TimeCoverageRelationStatistics Valid=394, Invalid=9605, Unknown=133, NotChecked=1640, Total=11772 [2022-11-18 20:58:33,125 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 5106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1951 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:58:33,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1946 Invalid, 5106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3049 Invalid, 0 Unknown, 1951 Unchecked, 4.8s Time] [2022-11-18 20:58:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-18 20:58:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2022-11-18 20:58:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 84 states have internal predecessors, (91), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:58:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-11-18 20:58:33,198 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 140 [2022-11-18 20:58:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:58:33,199 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-11-18 20:58:33,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 51 states have internal predecessors, (125), 14 states have call successors, (43), 10 states have call predecessors, (43), 13 states have return successors, (40), 19 states have call predecessors, (40), 12 states have call successors, (40) [2022-11-18 20:58:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-11-18 20:58:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-18 20:58:33,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:58:33,200 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:58:33,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:58:33,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:58:33,403 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:58:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 724294404, now seen corresponding path program 9 times [2022-11-18 20:58:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:33,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853237744] [2022-11-18 20:58:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:58:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:58:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:58:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:58:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:58:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:58:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:58:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:58:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:58:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:58:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:58:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:58:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:58:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:58:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-18 20:58:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:58:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-18 20:58:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:58:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:58:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:58:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:40,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 20:58:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 20:58:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-11-18 20:58:41,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:41,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853237744] [2022-11-18 20:58:41,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853237744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:58:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338815550] [2022-11-18 20:58:41,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:58:41,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:58:41,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:41,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:58:41,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 21:00:09,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 21:00:09,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:00:09,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 3503 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-18 21:00:09,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:00:09,686 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-18 21:00:09,843 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-18 21:00:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-18 21:00:10,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:00:13,826 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-18 21:00:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-18 21:00:14,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338815550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:00:14,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:00:14,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 22] total 61 [2022-11-18 21:00:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140367901] [2022-11-18 21:00:14,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:00:14,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-18 21:00:14,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:00:14,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-18 21:00:14,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3488, Unknown=0, NotChecked=0, Total=3660 [2022-11-18 21:00:14,120 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 61 states, 51 states have (on average 2.549019607843137) internal successors, (130), 50 states have internal predecessors, (130), 24 states have call successors, (50), 8 states have call predecessors, (50), 13 states have return successors, (48), 26 states have call predecessors, (48), 22 states have call successors, (48) [2022-11-18 21:00:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:00:46,187 INFO L93 Difference]: Finished difference Result 187 states and 221 transitions. [2022-11-18 21:00:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-18 21:00:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 51 states have (on average 2.549019607843137) internal successors, (130), 50 states have internal predecessors, (130), 24 states have call successors, (50), 8 states have call predecessors, (50), 13 states have return successors, (48), 26 states have call predecessors, (48), 22 states have call successors, (48) Word has length 141 [2022-11-18 21:00:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:00:46,190 INFO L225 Difference]: With dead ends: 187 [2022-11-18 21:00:46,190 INFO L226 Difference]: Without dead ends: 130 [2022-11-18 21:00:46,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 290 SyntacticMatches, 7 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=531, Invalid=9975, Unknown=0, NotChecked=0, Total=10506 [2022-11-18 21:00:46,192 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 240 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 4783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-11-18 21:00:46,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1488 Invalid, 4783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [182 Valid, 4601 Invalid, 0 Unknown, 0 Unchecked, 27.5s Time] [2022-11-18 21:00:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-18 21:00:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-18 21:00:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.072289156626506) internal successors, (89), 84 states have internal predecessors, (89), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 21:00:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-11-18 21:00:46,223 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 141 [2022-11-18 21:00:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:00:46,223 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-11-18 21:00:46,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 51 states have (on average 2.549019607843137) internal successors, (130), 50 states have internal predecessors, (130), 24 states have call successors, (50), 8 states have call predecessors, (50), 13 states have return successors, (48), 26 states have call predecessors, (48), 22 states have call successors, (48) [2022-11-18 21:00:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-11-18 21:00:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-18 21:00:46,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:00:46,225 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:46,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 21:00:46,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc716f12-61f1-49cd-a4a7-dc0c5a9f542e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 21:00:46,443 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:00:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 339575234, now seen corresponding path program 10 times [2022-11-18 21:00:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:00:46,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712469261] [2022-11-18 21:00:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:00:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat