./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/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_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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-e04fb08 [2022-11-16 12:39:27,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:39:27,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:39:27,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:39:27,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:39:27,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:39:27,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:39:27,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:39:27,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:39:27,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:39:27,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:39:27,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:39:27,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:39:27,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:39:27,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:39:27,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:39:27,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:39:27,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:39:27,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:39:27,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:39:27,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:39:27,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:39:27,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:39:27,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:39:27,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:39:27,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:39:27,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:39:27,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:39:27,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:39:27,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:39:27,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:39:27,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:39:27,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:39:27,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:39:27,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:39:27,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:39:27,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:39:27,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:39:27,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:39:27,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:39:27,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:39:27,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:39:27,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:39:27,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:39:27,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:39:27,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:39:27,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:39:27,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:39:27,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:39:27,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:39:27,117 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:39:27,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:39:27,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:39:27,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:39:27,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:39:27,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:39:27,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:39:27,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:39:27,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:39:27,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:39:27,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:39:27,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:39:27,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:39:27,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:27,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:39:27,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:39:27,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:39:27,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:39:27,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:39:27,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:39:27,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:39:27,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:39:27,123 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_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa [2022-11-16 12:39:27,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:39:27,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:39:27,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:39:27,381 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:39:27,382 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:39:27,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2022-11-16 12:39:27,450 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/data/35230788d/20517ab5a2f04f16b6076d65ccbbd1fd/FLAG36c9c1f19 [2022-11-16 12:39:28,206 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:39:28,207 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2022-11-16 12:39:28,247 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/data/35230788d/20517ab5a2f04f16b6076d65ccbbd1fd/FLAG36c9c1f19 [2022-11-16 12:39:28,764 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/data/35230788d/20517ab5a2f04f16b6076d65ccbbd1fd [2022-11-16 12:39:28,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:39:28,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:39:28,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:28,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:39:28,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:39:28,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:28" (1/1) ... [2022-11-16 12:39:28,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68dacf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:28, skipping insertion in model container [2022-11-16 12:39:28,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:28" (1/1) ... [2022-11-16 12:39:28,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:39:28,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:39:29,293 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2022-11-16 12:39:29,301 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2022-11-16 12:39:30,393 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,398 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,402 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,403 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,405 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,428 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,430 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,432 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,435 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:30,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:39:30,867 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:39:30,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:39:30,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:39:30,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:39:30,879 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:39:30,882 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:39:30,884 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:39:30,886 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:39:30,887 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:39:31,072 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:39:31,178 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,180 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:31,372 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:39:31,387 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2022-11-16 12:39:31,388 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2022-11-16 12:39:31,438 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,440 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,441 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,443 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,444 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,451 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,460 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,464 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,464 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,527 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 12:39:31,531 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 12:39:31,532 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 12:39:31,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 12:39:31,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 12:39:31,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 12:39:31,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 12:39:31,537 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 12:39:31,537 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 12:39:31,538 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 12:39:31,569 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 12:39:31,655 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,656 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 12:39:31,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:31,996 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:39:31,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31 WrapperNode [2022-11-16 12:39:31,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:31,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:31,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:39:31,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:39:32,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,248 INFO L138 Inliner]: procedures = 690, calls = 2737, calls flagged for inlining = 58, calls inlined = 6, statements flattened = 793 [2022-11-16 12:39:32,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:32,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:39:32,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:39:32,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:39:32,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,353 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:39:32,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:39:32,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:39:32,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:39:32,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (1/1) ... [2022-11-16 12:39:32,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:32,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:32,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:39:32,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:39:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-16 12:39:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-16 12:39:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:39:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-16 12:39:32,479 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-16 12:39:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-11-16 12:39:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-16 12:39:32,480 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-16 12:39:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-16 12:39:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-16 12:39:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:39:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 12:39:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 12:39:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-16 12:39:32,483 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-16 12:39:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:39:32,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:39:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:39:32,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:39:32,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:39:32,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:39:32,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:39:32,484 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-16 12:39:32,485 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-16 12:39:32,485 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2022-11-16 12:39:32,485 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2022-11-16 12:39:32,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 12:39:32,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 12:39:32,486 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-16 12:39:32,486 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-16 12:39:32,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:39:32,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:39:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-16 12:39:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-16 12:39:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:39:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-16 12:39:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-16 12:39:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:39:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-11-16 12:39:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-11-16 12:39:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-16 12:39:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-16 12:39:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-16 12:39:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-16 12:39:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 12:39:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 12:39:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:39:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-11-16 12:39:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:39:32,884 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:39:32,895 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:39:33,122 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-11-16 12:39:34,369 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:39:34,379 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:39:34,379 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 12:39:34,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:34 BoogieIcfgContainer [2022-11-16 12:39:34,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:39:34,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:39:34,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:39:34,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:39:34,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:28" (1/3) ... [2022-11-16 12:39:34,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b63ec02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:34, skipping insertion in model container [2022-11-16 12:39:34,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31" (2/3) ... [2022-11-16 12:39:34,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b63ec02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:34, skipping insertion in model container [2022-11-16 12:39:34,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:34" (3/3) ... [2022-11-16 12:39:34,395 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_array_harness.i [2022-11-16 12:39:34,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:39:34,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:39:34,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:39:34,484 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;@7e48be67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:39:34,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:39:34,489 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-16 12:39:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-16 12:39:34,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:34,500 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-16 12:39:34,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2057633121, now seen corresponding path program 1 times [2022-11-16 12:39:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:34,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712908655] [2022-11-16 12:39:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:39:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:39:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:39:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:39:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:39:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,448 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-16 12:39:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712908655] [2022-11-16 12:39:35,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712908655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:35,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:35,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:39:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387745288] [2022-11-16 12:39:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:39:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:39:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:39:35,508 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-16 12:39:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:36,254 INFO L93 Difference]: Finished difference Result 277 states and 358 transitions. [2022-11-16 12:39:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:39:36,257 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-16 12:39:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:36,276 INFO L225 Difference]: With dead ends: 277 [2022-11-16 12:39:36,276 INFO L226 Difference]: Without dead ends: 144 [2022-11-16 12:39:36,284 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-16 12:39:36,292 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-16 12:39:36,294 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-16 12:39:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-16 12:39:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2022-11-16 12:39:36,375 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-16 12:39:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-11-16 12:39:36,385 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 71 [2022-11-16 12:39:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:36,386 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-11-16 12:39:36,387 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-16 12:39:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-11-16 12:39:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-16 12:39:36,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:36,393 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-16 12:39:36,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:39:36,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash 866247645, now seen corresponding path program 1 times [2022-11-16 12:39:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:36,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322770513] [2022-11-16 12:39:36,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:39:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:39:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:39:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:39:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:39:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,328 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-16 12:39:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322770513] [2022-11-16 12:39:37,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322770513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:37,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:37,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:39:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752336241] [2022-11-16 12:39:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:37,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:39:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:39:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:37,332 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-16 12:39:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:38,260 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2022-11-16 12:39:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:38,261 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-16 12:39:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:38,263 INFO L225 Difference]: With dead ends: 188 [2022-11-16 12:39:38,263 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 12:39:38,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:39:38,264 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 62 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:38,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 314 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:39:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 12:39:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2022-11-16 12:39:38,280 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-16 12:39:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2022-11-16 12:39:38,281 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 71 [2022-11-16 12:39:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:38,282 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2022-11-16 12:39:38,282 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-16 12:39:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2022-11-16 12:39:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:39:38,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:38,284 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-16 12:39:38,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:39:38,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:38,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:38,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1202353843, now seen corresponding path program 1 times [2022-11-16 12:39:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:38,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160673307] [2022-11-16 12:39:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:38,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:39:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:39:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:39:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 12:39:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:39:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:39:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:39,006 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-16 12:39:39,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:39,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160673307] [2022-11-16 12:39:39,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160673307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:39,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:39,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:39:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097733069] [2022-11-16 12:39:39,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:39:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:39:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:39:39,014 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-16 12:39:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:40,099 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2022-11-16 12:39:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:39:40,100 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-16 12:39:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:40,103 INFO L225 Difference]: With dead ends: 203 [2022-11-16 12:39:40,103 INFO L226 Difference]: Without dead ends: 162 [2022-11-16 12:39:40,104 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-16 12:39:40,105 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 139 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:40,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 328 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 12:39:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-16 12:39:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2022-11-16 12:39:40,121 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-16 12:39:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-11-16 12:39:40,122 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 77 [2022-11-16 12:39:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:40,123 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-11-16 12:39:40,123 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-16 12:39:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-11-16 12:39:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 12:39:40,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:40,126 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-16 12:39:40,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:39:40,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 845366680, now seen corresponding path program 1 times [2022-11-16 12:39:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:40,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501237278] [2022-11-16 12:39:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:39:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:39:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:39:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:39:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:39:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:39:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:39:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:39:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:39:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:39:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:39:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 12:39:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,404 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-16 12:39:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:41,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501237278] [2022-11-16 12:39:41,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501237278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:41,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:41,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:39:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103853105] [2022-11-16 12:39:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:41,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:39:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:39:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:39:41,408 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-16 12:39:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:42,838 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-11-16 12:39:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:39:42,839 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-16 12:39:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:42,841 INFO L225 Difference]: With dead ends: 206 [2022-11-16 12:39:42,841 INFO L226 Difference]: Without dead ends: 152 [2022-11-16 12:39:42,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:39:42,842 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:42,842 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.2s Time] [2022-11-16 12:39:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-16 12:39:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2022-11-16 12:39:42,866 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-16 12:39:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-11-16 12:39:42,867 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 121 [2022-11-16 12:39:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:42,871 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-11-16 12:39:42,871 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-16 12:39:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-11-16 12:39:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-16 12:39:42,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:42,879 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-16 12:39:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:39:42,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:42,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 606085033, now seen corresponding path program 1 times [2022-11-16 12:39:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:42,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148324969] [2022-11-16 12:39:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:39:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:39:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:39:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:39:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:39:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:39:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:39:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:39:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:39:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:39:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:39:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 12:39:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:44,190 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-16 12:39:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148324969] [2022-11-16 12:39:44,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148324969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:44,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:44,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:39:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239131152] [2022-11-16 12:39:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:39:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:39:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:39:44,194 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-16 12:39:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:45,737 INFO L93 Difference]: Finished difference Result 212 states and 256 transitions. [2022-11-16 12:39:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:39:45,738 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-16 12:39:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:45,740 INFO L225 Difference]: With dead ends: 212 [2022-11-16 12:39:45,740 INFO L226 Difference]: Without dead ends: 144 [2022-11-16 12:39:45,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:39:45,741 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 122 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:45,742 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.2s Time] [2022-11-16 12:39:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-16 12:39:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2022-11-16 12:39:45,755 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-16 12:39:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2022-11-16 12:39:45,757 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 127 [2022-11-16 12:39:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:45,757 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2022-11-16 12:39:45,758 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-16 12:39:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-11-16 12:39:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-16 12:39:45,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:45,760 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-16 12:39:45,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:39:45,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:39:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1368893272, now seen corresponding path program 1 times [2022-11-16 12:39:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:45,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167949328] [2022-11-16 12:39:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:39:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:39:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:39:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:39:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:39:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:39:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:39:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:39:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:39:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:39:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:39:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:39:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:39:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:39:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:39:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 12:39:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167949328] [2022-11-16 12:39:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167949328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:39:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799683681] [2022-11-16 12:39:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:52,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:52,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:52,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:39:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:53,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-16 12:39:53,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:54,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:39:54,856 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 96 treesize of output 78 [2022-11-16 12:39:54,886 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:39:54,887 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 77 treesize of output 104 [2022-11-16 12:39:54,959 INFO L321 Elim1Store]: treesize reduction 118, result has 7.1 percent of original size [2022-11-16 12:39:54,960 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 106 treesize of output 70 [2022-11-16 12:39:56,264 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-16 12:39:56,265 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 183 treesize of output 114 [2022-11-16 12:39:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-16 12:39:56,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:40:54,700 WARN L233 SmtUtils]: Spent 48.72s on a formula simplification. DAG size of input: 184 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:40:56,432 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 144 treesize of output 132 [2022-11-16 12:40:56,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 37 [2022-11-16 12:40:56,443 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 144 treesize of output 132 [2022-11-16 12:40:56,456 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-16 12:40:56,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 232 [2022-11-16 12:40:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-16 12:40:57,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799683681] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:40:57,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:40:57,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 32, 19] total 68 [2022-11-16 12:40:57,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319296398] [2022-11-16 12:40:57,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:40:57,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-16 12:40:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:57,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-16 12:40:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4359, Unknown=1, NotChecked=0, Total=4556 [2022-11-16 12:40:57,890 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 68 states, 57 states have (on average 2.491228070175439) internal successors, (142), 48 states have internal predecessors, (142), 24 states have call successors, (55), 14 states have call predecessors, (55), 17 states have return successors, (53), 29 states have call predecessors, (53), 19 states have call successors, (53) [2022-11-16 12:41:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:09,867 INFO L93 Difference]: Finished difference Result 217 states and 261 transitions. [2022-11-16 12:41:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 12:41:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 57 states have (on average 2.491228070175439) internal successors, (142), 48 states have internal predecessors, (142), 24 states have call successors, (55), 14 states have call predecessors, (55), 17 states have return successors, (53), 29 states have call predecessors, (53), 19 states have call successors, (53) Word has length 132 [2022-11-16 12:41:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:09,870 INFO L225 Difference]: With dead ends: 217 [2022-11-16 12:41:09,870 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 12:41:09,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 259 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 61.7s TimeCoverageRelationStatistics Valid=636, Invalid=10919, Unknown=1, NotChecked=0, Total=11556 [2022-11-16 12:41:09,876 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 254 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 4794 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 5449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 4794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:09,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 2068 Invalid, 5449 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [185 Valid, 4794 Invalid, 0 Unknown, 470 Unchecked, 8.0s Time] [2022-11-16 12:41:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 12:41:09,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2022-11-16 12:41:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 97 states have (on average 1.1030927835051547) internal successors, (107), 101 states have internal predecessors, (107), 36 states have call successors, (36), 18 states have call predecessors, (36), 21 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2022-11-16 12:41:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2022-11-16 12:41:09,899 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 132 [2022-11-16 12:41:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:09,900 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2022-11-16 12:41:09,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 57 states have (on average 2.491228070175439) internal successors, (142), 48 states have internal predecessors, (142), 24 states have call successors, (55), 14 states have call predecessors, (55), 17 states have return successors, (53), 29 states have call predecessors, (53), 19 states have call successors, (53) [2022-11-16 12:41:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2022-11-16 12:41:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-16 12:41:09,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:09,902 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-16 12:41:09,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:41:10,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:41:10,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1120489894, now seen corresponding path program 1 times [2022-11-16 12:41:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:10,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782646589] [2022-11-16 12:41:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:41:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:41:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:41:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:41:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:41:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:41:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:10,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:41:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:41:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:41:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:41:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:41:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:41:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:41:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:41:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 12:41:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-16 12:41:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:11,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782646589] [2022-11-16 12:41:11,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782646589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:11,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:11,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-16 12:41:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592326471] [2022-11-16 12:41:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:11,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:41:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:41:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:41:11,594 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:41:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:14,274 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2022-11-16 12:41:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:41:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2022-11-16 12:41:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:14,276 INFO L225 Difference]: With dead ends: 214 [2022-11-16 12:41:14,276 INFO L226 Difference]: Without dead ends: 170 [2022-11-16 12:41:14,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 12:41:14,277 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 175 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:14,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 800 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-16 12:41:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-16 12:41:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2022-11-16 12:41:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 103 states have (on average 1.1067961165048543) internal successors, (114), 108 states have internal predecessors, (114), 36 states have call successors, (36), 18 states have call predecessors, (36), 22 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-11-16 12:41:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2022-11-16 12:41:14,299 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 138 [2022-11-16 12:41:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:14,299 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2022-11-16 12:41:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:41:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2022-11-16 12:41:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-16 12:41:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:14,302 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-16 12:41:14,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:41:14,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash 727462884, now seen corresponding path program 1 times [2022-11-16 12:41:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:14,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709595392] [2022-11-16 12:41:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:41:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:41:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:41:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:41:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:41:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:41:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:41:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:41:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:41:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:41:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:41:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:41:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:41:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:41:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 12:41:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-16 12:41:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709595392] [2022-11-16 12:41:15,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709595392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:15,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:15,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-16 12:41:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430082660] [2022-11-16 12:41:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:15,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:41:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:41:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:41:15,474 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:41:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:17,845 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2022-11-16 12:41:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:41:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2022-11-16 12:41:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:17,847 INFO L225 Difference]: With dead ends: 225 [2022-11-16 12:41:17,847 INFO L226 Difference]: Without dead ends: 166 [2022-11-16 12:41:17,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 12:41:17,849 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 145 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:17,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 721 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-16 12:41:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-16 12:41:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2022-11-16 12:41:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.0909090909090908) internal successors, (108), 103 states have internal predecessors, (108), 36 states have call successors, (36), 18 states have call predecessors, (36), 21 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2022-11-16 12:41:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-11-16 12:41:17,867 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 138 [2022-11-16 12:41:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:17,867 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-11-16 12:41:17,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:41:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-11-16 12:41:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-16 12:41:17,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:17,870 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, 1] [2022-11-16 12:41:17,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:41:17,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash -899607246, now seen corresponding path program 1 times [2022-11-16 12:41:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:17,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963857624] [2022-11-16 12:41:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:17,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:41:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:41:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:41:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:41:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:41:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:41:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:41:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:41:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:41:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:41:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:41:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:41:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:41:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:41:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:41:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 12:41:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963857624] [2022-11-16 12:41:18,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963857624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:18,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:18,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:41:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417180242] [2022-11-16 12:41:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:18,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:41:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:41:18,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:41:18,625 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:41:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:19,926 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2022-11-16 12:41:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:41:19,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2022-11-16 12:41:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:19,928 INFO L225 Difference]: With dead ends: 249 [2022-11-16 12:41:19,928 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 12:41:19,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:41:19,929 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 213 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:19,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 398 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:41:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 12:41:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-16 12:41:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:41:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2022-11-16 12:41:19,943 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 139 [2022-11-16 12:41:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:19,944 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2022-11-16 12:41:19,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:41:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-11-16 12:41:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-16 12:41:19,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:19,946 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-16 12:41:19,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:41:19,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1108978750, now seen corresponding path program 1 times [2022-11-16 12:41:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:19,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766612756] [2022-11-16 12:41:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:41:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:41:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:41:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:41:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:41:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:41:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:41:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:41:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:41:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:41:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:41:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:41:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:41:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:41:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 12:41:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:20,913 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-16 12:41:20,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:20,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766612756] [2022-11-16 12:41:20,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766612756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:20,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:20,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:41:20,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344325545] [2022-11-16 12:41:20,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:20,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:41:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:41:20,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:41:20,916 INFO L87 Difference]: Start difference. First operand 125 states and 146 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-16 12:41:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:41:22,065 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2022-11-16 12:41:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:41:22,066 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-16 12:41:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:41:22,067 INFO L225 Difference]: With dead ends: 176 [2022-11-16 12:41:22,067 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 12:41:22,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:41:22,069 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:41:22,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 162 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:41:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 12:41:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-16 12:41:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 80 states have internal predecessors, (85), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:41:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-11-16 12:41:22,085 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 133 [2022-11-16 12:41:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:41:22,086 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-11-16 12:41:22,087 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-16 12:41:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-11-16 12:41:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-16 12:41:22,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:41:22,089 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-16 12:41:22,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:41:22,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:41:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1489473318, now seen corresponding path program 1 times [2022-11-16 12:41:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:22,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581013526] [2022-11-16 12:41:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:41:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:41:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:41:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:41:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:41:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:41:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:41:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:41:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:41:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:41:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:41:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:41:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:41:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:41:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:41:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:41:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:27,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 12:41:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-16 12:41:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:27,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581013526] [2022-11-16 12:41:27,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581013526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:41:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891453651] [2022-11-16 12:41:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:41:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:41:27,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:41:27,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:41:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:28,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 12:41:28,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:41:41,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:41:41,694 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1034 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66|))) (and (= (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_9_66| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_1034)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| .cse0))))) is different from true [2022-11-16 12:41:41,987 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1325_9| Int) (v_ArrVal_1034 Int) (v_ArrVal_1036 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66|))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_1034) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_9| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1036))) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_9_66| .cse0)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_9|)))) is different from true [2022-11-16 12:41:42,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:41:42,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:41:42,132 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2022-11-16 12:41:42,133 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-16 12:41:42,409 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-16 12:41:42,453 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:41:42,453 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-16 12:41:57,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:41:57,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 303 [2022-11-16 12:41:58,048 INFO L321 Elim1Store]: treesize reduction 106, result has 35.8 percent of original size [2022-11-16 12:41:58,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 1009 treesize of output 955 [2022-11-16 12:41:58,601 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-16 12:41:58,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:42:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891453651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:42:11,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:42:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 55 [2022-11-16 12:42:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372823896] [2022-11-16 12:42:11,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:42:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-16 12:42:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:42:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-16 12:42:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=3616, Unknown=15, NotChecked=242, Total=4032 [2022-11-16 12:42:12,000 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 55 states, 48 states have (on average 2.375) internal successors, (114), 39 states have internal predecessors, (114), 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-16 12:42:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:42:33,818 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2022-11-16 12:42:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 12:42:33,819 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 48 states have (on average 2.375) internal successors, (114), 39 states have internal predecessors, (114), 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 134 [2022-11-16 12:42:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:42:33,820 INFO L225 Difference]: With dead ends: 184 [2022-11-16 12:42:33,820 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 12:42:33,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 57.2s TimeCoverageRelationStatistics Valid=339, Invalid=7303, Unknown=22, NotChecked=346, Total=8010 [2022-11-16 12:42:33,823 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:42:33,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1511 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2514 Invalid, 0 Unknown, 880 Unchecked, 4.2s Time] [2022-11-16 12:42:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 12:42:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-11-16 12:42:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 81 states have internal predecessors, (86), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:42:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-11-16 12:42:33,839 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 134 [2022-11-16 12:42:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:42:33,839 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-11-16 12:42:33,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 48 states have (on average 2.375) internal successors, (114), 39 states have internal predecessors, (114), 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-16 12:42:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-11-16 12:42:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:42:33,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:42:33,841 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-16 12:42:33,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:42:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:42:34,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:42:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:42:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 982362820, now seen corresponding path program 2 times [2022-11-16 12:42:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:42:34,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693817795] [2022-11-16 12:42:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:42:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:42:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:42:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:42:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:42:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:42:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:42:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:42:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:42:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:42:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:42:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:42:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:42:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:42:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:42:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:42:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:42:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:42:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:42:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:42:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:42:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:42:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:37,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:42:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:42:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:42:38,403 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-16 12:42:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:42:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693817795] [2022-11-16 12:42:38,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693817795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:42:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847934699] [2022-11-16 12:42:38,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:42:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:42:38,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:42:38,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:42:38,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:42:39,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:42:39,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:42:39,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 3043 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-16 12:42:39,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:42:43,946 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_mod_ULTIMATE.start_aws_string_new_from_array_harness_~alloc_size~2#1_119| Int)) (and (<= (mod c_aws_string_new_from_array_~len 18446744073709551616) (mod (+ 36028797018963967 (* |aux_mod_ULTIMATE.start_aws_string_new_from_array_harness_~alloc_size~2#1_119| 18446744073709551615)) 18446744073709551616)) (<= 0 |aux_mod_ULTIMATE.start_aws_string_new_from_array_harness_~alloc_size~2#1_119|) (<= |aux_mod_ULTIMATE.start_aws_string_new_from_array_harness_~alloc_size~2#1_119| 36028797018963967))) is different from true [2022-11-16 12:42:44,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:42:45,086 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_16| Int) (v_ArrVal_1536 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_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1536)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_16|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_16| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-16 12:42:45,101 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_17| Int) (v_ArrVal_1543 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_16| Int) (v_ArrVal_1536 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_16|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_16| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_17|) (= |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_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1536) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_17| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1543))))) is different from true [2022-11-16 12:42:45,300 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_17| Int) (v_ArrVal_1543 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_16| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_16| Int) (v_ArrVal_1545 Int) (v_ArrVal_1536 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_16|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_16|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_16| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_17|) (= (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_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1536) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_17| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1543) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1545)) |c_#memory_int|))) is different from true [2022-11-16 12:42:45,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:42:45,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:42:45,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:42:45,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:42:45,424 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-16 12:42:45,425 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-16 12:42:45,458 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 88 treesize of output 73 [2022-11-16 12:42:45,504 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:42:45,505 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 72 treesize of output 103 [2022-11-16 12:42:45,529 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-16 12:42:49,859 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-16 12:42:49,860 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 184 treesize of output 117 [2022-11-16 12:42:50,130 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-16 12:42:50,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:13,351 WARN L233 SmtUtils]: Spent 12.67s on a formula simplification. DAG size of input: 133 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:43:13,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847934699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:13,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:43:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 37] total 56 [2022-11-16 12:43:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002436610] [2022-11-16 12:43:13,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:13,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-16 12:43:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:13,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-16 12:43:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3515, Unknown=8, NotChecked=484, Total=4160 [2022-11-16 12:43:13,358 INFO L87 Difference]: Start difference. First operand 127 states and 148 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-16 12:43:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:26,595 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-11-16 12:43:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 12:43:26,596 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-16 12:43:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:26,598 INFO L225 Difference]: With dead ends: 184 [2022-11-16 12:43:26,598 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 12:43:26,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=330, Invalid=7331, Unknown=11, NotChecked=700, Total=8372 [2022-11-16 12:43:26,601 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 172 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 4631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1751 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:26,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1818 Invalid, 4631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2740 Invalid, 0 Unknown, 1751 Unchecked, 4.8s Time] [2022-11-16 12:43:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 12:43:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-16 12:43:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.0875) internal successors, (87), 82 states have internal predecessors, (87), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:43:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-11-16 12:43:26,632 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 135 [2022-11-16 12:43:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:26,633 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-11-16 12:43:26,634 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-16 12:43:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-11-16 12:43:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 12:43:26,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:26,637 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-16 12:43:26,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:26,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:26,855 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash 299871770, now seen corresponding path program 3 times [2022-11-16 12:43:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:26,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172088160] [2022-11-16 12:43:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:43:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:43:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:43:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:43:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:43:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:43:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:43:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:43:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:43:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:43:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:43:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:43:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:43:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:43:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:43:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:43:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 12:43:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-16 12:43:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:31,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172088160] [2022-11-16 12:43:31,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172088160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:31,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529218745] [2022-11-16 12:43:31,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:43:31,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:31,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:31,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:43:35,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:43:35,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:43:35,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 2947 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-16 12:43:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:36,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:43:36,267 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2232 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_27| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_27|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_27| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_27| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2232))))) is different from true [2022-11-16 12:43:36,294 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2232 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_28| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_27| Int) (v_ArrVal_2238 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_27|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_28| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_27| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_28|) (= (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_27| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2232) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2238)) |c_#memory_int|))) is different from true [2022-11-16 12:43:36,323 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2232 Int) (v_ArrVal_2245 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_28| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_27| Int) (v_ArrVal_2238 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_29| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_27|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_28| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_29|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_27| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_28|) (= (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_27| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2232) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2238) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_29| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2245)) |c_#memory_int|))) is different from true [2022-11-16 12:43:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:36,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:43:37,013 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 12:43:37,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2022-11-16 12:43:37,147 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:43:37,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-16 12:43:38,467 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 12:43:38,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 12:43:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 6 not checked. [2022-11-16 12:43:38,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:52,954 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:43:52,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529218745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:52,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:43:52,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-11-16 12:43:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556332992] [2022-11-16 12:43:52,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 12:43:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:52,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 12:43:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3167, Unknown=4, NotChecked=342, Total=3660 [2022-11-16 12:43:52,961 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 52 states, 47 states have (on average 2.297872340425532) internal successors, (108), 39 states have internal predecessors, (108), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 12:44:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:04,974 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-11-16 12:44:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 12:44:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.297872340425532) internal successors, (108), 39 states have internal predecessors, (108), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 136 [2022-11-16 12:44:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:04,978 INFO L225 Difference]: With dead ends: 185 [2022-11-16 12:44:04,979 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 12:44:04,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=338, Invalid=6976, Unknown=8, NotChecked=510, Total=7832 [2022-11-16 12:44:04,985 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 183 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 3003 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 861 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:04,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1442 Invalid, 4026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3003 Invalid, 0 Unknown, 861 Unchecked, 5.1s Time] [2022-11-16 12:44:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 12:44:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-16 12:44:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 83 states have internal predecessors, (88), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:44:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2022-11-16 12:44:05,015 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 136 [2022-11-16 12:44:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:05,016 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2022-11-16 12:44:05,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.297872340425532) internal successors, (108), 39 states have internal predecessors, (108), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 12:44:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-11-16 12:44:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-16 12:44:05,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:05,019 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-16 12:44:05,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:05,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:44:05,243 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:44:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash 617485700, now seen corresponding path program 4 times [2022-11-16 12:44:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:05,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739089576] [2022-11-16 12:44:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:44:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:44:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:44:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:44:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:44:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:44:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:44:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:44:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:44:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:44:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:44:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:44:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:44:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:44:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:44:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:44:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:44:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:44:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:44:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:44:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:44:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:44:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:09,641 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-16 12:44:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:09,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739089576] [2022-11-16 12:44:09,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739089576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059711268] [2022-11-16 12:44:09,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:44:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:09,646 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:09,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:44:10,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:44:10,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:10,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 3311 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-16 12:44:10,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:25,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:44:25,579 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (v_ArrVal_3126 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|))) (and (= (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_42_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3126)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|)))) is different from true [2022-11-16 12:44:25,623 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (v_ArrVal_3126 Int) (v_ArrVal_3134 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 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_42_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3126) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3134)) |c_#memory_int|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|)))) is different from true [2022-11-16 12:44:25,684 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3134 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (= (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_42_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3126) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3134) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3139)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|)))) is different from true [2022-11-16 12:44:25,752 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3134 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_45| Int) (v_ArrVal_3143 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3126) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3134) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3139) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_45| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3143))) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_45|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|)))) is different from true [2022-11-16 12:44:26,243 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_28| Int) (v_ArrVal_3147 Int) (v_ArrVal_3134 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_45| Int) (v_ArrVal_3143 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (= (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_42_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3126) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3134) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3139) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_45| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3143) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3147)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_28|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_45|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_42_67|)))) is different from true [2022-11-16 12:44:26,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:26,502 INFO L321 Elim1Store]: treesize reduction 63, result has 48.8 percent of original size [2022-11-16 12:44:26,503 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-16 12:44:26,833 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-16 12:44:26,881 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:44:26,882 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-16 12:44:26,895 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:44:41,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:44:41,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 312 [2022-11-16 12:44:41,774 INFO L321 Elim1Store]: treesize reduction 106, result has 35.8 percent of original size [2022-11-16 12:44:41,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 928 treesize of output 876 [2022-11-16 12:44:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 11 not checked. [2022-11-16 12:44:42,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:01,782 WARN L233 SmtUtils]: Spent 24.79s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:46:01,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059711268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:01,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:01,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 40] total 61 [2022-11-16 12:46:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502327709] [2022-11-16 12:46:01,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:01,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-16 12:46:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-16 12:46:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3975, Unknown=34, NotChecked=650, Total=4830 [2022-11-16 12:46:01,794 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 61 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 45 states have internal predecessors, (120), 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-16 12:46:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:35,204 INFO L93 Difference]: Finished difference Result 187 states and 221 transitions. [2022-11-16 12:46:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 12:46:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 45 states have internal predecessors, (120), 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 137 [2022-11-16 12:46:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:35,206 INFO L225 Difference]: With dead ends: 187 [2022-11-16 12:46:35,206 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 12:46:35,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 132.8s TimeCoverageRelationStatistics Valid=360, Invalid=8353, Unknown=49, NotChecked=940, Total=9702 [2022-11-16 12:46:35,208 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 162 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 4649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1597 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:35,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1877 Invalid, 4649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2917 Invalid, 0 Unknown, 1597 Unchecked, 4.6s Time] [2022-11-16 12:46:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 12:46:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-11-16 12:46:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 84 states have internal predecessors, (89), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:46:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2022-11-16 12:46:35,224 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 137 [2022-11-16 12:46:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:35,225 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2022-11-16 12:46:35,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 45 states have internal predecessors, (120), 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-16 12:46:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2022-11-16 12:46:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-16 12:46:35,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:35,226 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-16 12:46:35,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 12:46:35,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 12:46:35,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1873582938, now seen corresponding path program 5 times [2022-11-16 12:46:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:35,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230808421] [2022-11-16 12:46:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:46:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:46:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:46:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:46:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:46:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:46:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:46:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:46:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:46:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:46:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:46:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:46:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:46:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:46:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:46:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 12:46:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-16 12:46:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230808421] [2022-11-16 12:46:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230808421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304408738] [2022-11-16 12:46:40,232 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:46:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:40,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:40,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:47:10,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-16 12:47:10,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:47:10,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 3445 conjuncts, 189 conjunts are in the unsatisfiable core [2022-11-16 12:47:10,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:13,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:47:13,668 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4209 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_61| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4209))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-16 12:47:13,685 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4209 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_62| Int) (v_ArrVal_4215 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_61| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_62|) (= (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_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4209) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4215)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-16 12:47:13,732 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4209 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_62| Int) (v_ArrVal_4215 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_61| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (v_ArrVal_4221 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_62|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_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_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4209) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4215) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4221)) |c_#memory_int|)))) is different from true [2022-11-16 12:47:13,834 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_64| Int) (v_ArrVal_4209 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_62| Int) (v_ArrVal_4215 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_61| Int) (v_ArrVal_4227 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (v_ArrVal_4221 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4209) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4215) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4221) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_64| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4227)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_64|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_62|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_64| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-16 12:47:13,911 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_64| Int) (v_ArrVal_4209 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_65| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_62| Int) (v_ArrVal_4215 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_61| Int) (v_ArrVal_4227 Int) (v_ArrVal_4238 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (v_ArrVal_4221 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_64| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_65|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_64|) (= |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_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4209) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4215) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4221) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_64| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4227) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4238))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_62|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|)))) is different from true [2022-11-16 12:47:14,403 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4209 Int) (v_ArrVal_4215 Int) (v_ArrVal_4227 Int) (v_ArrVal_4238 Int) (v_ArrVal_4221 Int) (v_ArrVal_4240 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_64| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_65| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_61| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_35| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_64| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_65|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_35|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_64|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_62|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67|) (= (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_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4209) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4215) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_63_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4221) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_64| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4227) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4238) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_35| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4240)) |c_#memory_int|)))) is different from true [2022-11-16 12:47:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:14,731 INFO L321 Elim1Store]: treesize reduction 77, result has 48.7 percent of original size [2022-11-16 12:47:14,731 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-16 12:47:14,992 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-16 12:47:15,022 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:47:15,022 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-16 12:47:15,078 INFO L321 Elim1Store]: treesize reduction 118, result has 7.1 percent of original size [2022-11-16 12:47:15,078 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 110 treesize of output 74 [2022-11-16 12:47:18,980 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-16 12:47:18,980 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-16 12:47:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 74 trivial. 16 not checked. [2022-11-16 12:47:19,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:32,727 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_aws_string_new_from_array_~len 18446744073709551616))) (let ((.cse4 (+ c_aws_string_new_from_array_~str~2.offset 8)) (.cse5 (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 (not .cse0) (let ((.cse7 (+ c_aws_string_new_from_array_~str~2.offset .cse1 16))) (and (forall ((|v_#Ultimate.C_memcpy_dest.offset_20| Int)) (or (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (or (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (let ((.cse6 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_81| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_81|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_82| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_40| Int)) (or (forall ((v_ArrVal_4282 Int) (v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4286 Int) (v_ArrVal_4284 Int) (v_ArrVal_4285 Int)) (let ((.cse2 (store (store (store (store (store (store (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_82|) v_ArrVal_4285) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) v_ArrVal_4283) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| |v_#Ultimate.C_memcpy_dest.offset_20| .cse6) v_ArrVal_4281) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_78|) v_ArrVal_4286) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_81|) v_ArrVal_4284) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1325_40|) v_ArrVal_4282) .cse7 0))) (let ((.cse3 (mod (select .cse2 .cse4) 18446744073709551616))) (or (= (mod (select .cse2 (+ c_aws_string_new_from_array_~str~2.offset .cse3 (- 18446744073709551600))) 256) 0) (= (mod (select .cse2 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse3)) 256) 0))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_40|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_82| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|)) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_82|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse6))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse6 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|))))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_20|)))) (forall ((|v_#Ultimate.C_memcpy_dest.offset_20| Int)) (or (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (or (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (let ((.cse11 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_81| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_82| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_82| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_40| Int)) (or (forall ((v_ArrVal_4282 Int) (v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4286 Int) (v_ArrVal_4284 Int) (v_ArrVal_4285 Int)) (let ((.cse9 (store (store (store (store (store (store (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_82|) v_ArrVal_4285) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) v_ArrVal_4283) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| |v_#Ultimate.C_memcpy_dest.offset_20| .cse11) v_ArrVal_4281) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_78|) v_ArrVal_4286) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_81|) v_ArrVal_4284) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1325_40|) v_ArrVal_4282) .cse7 0))) (let ((.cse10 (mod (select .cse9 .cse4) 18446744073709551616))) (or (= (mod (select .cse9 (+ c_aws_string_new_from_array_~str~2.offset .cse10 (- 18446744073709551600))) 256) 0) (<= .cse10 9223372036854775807))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_40|)))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_82|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_81|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse11))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse11 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|))))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_20|)))) (forall ((|v_#Ultimate.C_memcpy_dest.offset_20| Int)) (or (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_20|)) (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (or (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (let ((.cse14 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_81| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_81|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_82| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_40| Int)) (or (forall ((v_ArrVal_4282 Int) (v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4286 Int) (v_ArrVal_4284 Int) (v_ArrVal_4285 Int)) (let ((.cse13 (store (store (store (store (store (store (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_82|) v_ArrVal_4285) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) v_ArrVal_4283) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| |v_#Ultimate.C_memcpy_dest.offset_20| .cse14) v_ArrVal_4281) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_78|) v_ArrVal_4286) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_81|) v_ArrVal_4284) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1325_40|) v_ArrVal_4282) .cse7 0))) (let ((.cse12 (mod (select .cse13 .cse4) 18446744073709551616))) (or (not (<= .cse12 9223372036854775807)) (= (mod (select .cse13 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse12)) 256) 0))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_40|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_82| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|)) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_82|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse14))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse14 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|)))))))))))) (or (let ((.cse18 (+ c_aws_string_new_from_array_~str~2.offset .cse1 (- 18446744073709551600)))) (and (forall ((|v_#Ultimate.C_memcpy_dest.offset_20| Int)) (or (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (let ((.cse17 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_81| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_81|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_82| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_82| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_40| Int)) (or (forall ((v_ArrVal_4282 Int) (v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4286 Int) (v_ArrVal_4284 Int) (v_ArrVal_4285 Int)) (let ((.cse16 (store (store (store (store (store (store (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_82|) v_ArrVal_4285) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) v_ArrVal_4283) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| |v_#Ultimate.C_memcpy_dest.offset_20| .cse17) v_ArrVal_4281) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_78|) v_ArrVal_4286) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_81|) v_ArrVal_4284) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1325_40|) v_ArrVal_4282) .cse18 0))) (let ((.cse15 (mod (select .cse16 .cse4) 18446744073709551616))) (or (not (<= .cse15 9223372036854775807)) (= (mod (select .cse16 (+ c_aws_string_new_from_array_~str~2.offset .cse15 16)) 256) 0))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_40|)))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_82|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse17))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse17 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|))))) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_20|)))) (forall ((|v_#Ultimate.C_memcpy_dest.offset_20| Int)) (or (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (or (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (let ((.cse21 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_81| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_81|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_82| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_82| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_40| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_40|)) (forall ((v_ArrVal_4282 Int) (v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4286 Int) (v_ArrVal_4284 Int) (v_ArrVal_4285 Int)) (let ((.cse20 (store (store (store (store (store (store (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_82|) v_ArrVal_4285) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) v_ArrVal_4283) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| |v_#Ultimate.C_memcpy_dest.offset_20| .cse21) v_ArrVal_4281) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_78|) v_ArrVal_4286) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_81|) v_ArrVal_4284) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1325_40|) v_ArrVal_4282) .cse18 0))) (let ((.cse19 (mod (select .cse20 .cse4) 18446744073709551616))) (or (<= .cse19 9223372036854775807) (= (mod (select .cse20 (+ c_aws_string_new_from_array_~str~2.offset .cse19 (- 18446744073709551600))) 256) 0))))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_82|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse21))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse21 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|))))))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_20|)))) (forall ((|v_#Ultimate.C_memcpy_dest.offset_20| Int)) (or (forall ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_78| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| Int)) (let ((.cse24 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_79| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_81| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_78| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_81|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1316_82| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_82| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_79|)) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_82|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1325_40| Int)) (or (forall ((v_ArrVal_4282 Int) (v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4286 Int) (v_ArrVal_4284 Int) (v_ArrVal_4285 Int)) (let ((.cse22 (store (store (store (store (store (store (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_82|) v_ArrVal_4285) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_79|) v_ArrVal_4283) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| |v_#Ultimate.C_memcpy_dest.offset_20| .cse24) v_ArrVal_4281) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_78|) v_ArrVal_4286) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1316_81|) v_ArrVal_4284) (+ |v_#Ultimate.C_memcpy_dest.offset_20| |v_#Ultimate.C_memcpy_#t~loopctr1325_40|) v_ArrVal_4282) .cse18 0))) (let ((.cse23 (mod (select .cse22 .cse4) 18446744073709551616))) (or (= (mod (select .cse22 (+ c_aws_string_new_from_array_~str~2.offset .cse23 16)) 256) 0) (= (mod (select .cse22 (+ c_aws_string_new_from_array_~str~2.offset .cse23 (- 18446744073709551600))) 256) 0))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_40|)))))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_79| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse24))))) (not (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67| .cse24 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_78|))))) (<= .cse1 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|) (> 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_80_67|))) (not (<= .cse8 |v_#Ultimate.C_memcpy_dest.offset_20|)))))) .cse0)))) is different from false [2022-11-16 12:47:32,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304408738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:32,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:47:32,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 47] total 71 [2022-11-16 12:47:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194769973] [2022-11-16 12:47:32,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:32,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-16 12:47:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-16 12:47:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5086, Unknown=8, NotChecked=1036, Total=6320 [2022-11-16 12:47:32,754 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 71 states, 62 states have (on average 2.032258064516129) internal successors, (126), 53 states have internal predecessors, (126), 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-16 12:47:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:47,217 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-11-16 12:47:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-16 12:47:47,218 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 62 states have (on average 2.032258064516129) internal successors, (126), 53 states have internal predecessors, (126), 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 138 [2022-11-16 12:47:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:47,219 INFO L225 Difference]: With dead ends: 185 [2022-11-16 12:47:47,219 INFO L226 Difference]: Without dead ends: 135 [2022-11-16 12:47:47,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=461, Invalid=11761, Unknown=16, NotChecked=1568, Total=13806 [2022-11-16 12:47:47,222 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 3519 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1708 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:47,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 2028 Invalid, 5276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3519 Invalid, 0 Unknown, 1708 Unchecked, 5.5s Time] [2022-11-16 12:47:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-16 12:47:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-11-16 12:47:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:47:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2022-11-16 12:47:47,243 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 138 [2022-11-16 12:47:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:47,243 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2022-11-16 12:47:47,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 62 states have (on average 2.032258064516129) internal successors, (126), 53 states have internal predecessors, (126), 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-16 12:47:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2022-11-16 12:47:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-16 12:47:47,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:47,245 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-16 12:47:47,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:47,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:47:47,466 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2137075644, now seen corresponding path program 6 times [2022-11-16 12:47:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:47,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429525779] [2022-11-16 12:47:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:47:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:47:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:47:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:47:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:47:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:47:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:47:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:47:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:47:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:47:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:47:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:47:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:47:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:47:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:47:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:47:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:47:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-16 12:47:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:52,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429525779] [2022-11-16 12:47:52,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429525779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:52,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39487963] [2022-11-16 12:47:52,568 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:47:52,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:52,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:52,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:48:12,391 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-16 12:48:12,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:12,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-16 12:48:12,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:12,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:48:13,070 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5491 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_84| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_84|) (= (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_84| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5491)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) is different from true [2022-11-16 12:48:13,088 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_85| Int) (v_ArrVal_5491 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_84| Int) (v_ArrVal_5498 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_84|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5491) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5498)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_85|))) is different from true [2022-11-16 12:48:13,119 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_85| Int) (v_ArrVal_5491 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_84| Int) (v_ArrVal_5502 Int) (v_ArrVal_5498 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_84|) (= (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_84| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5491) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5498) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5502)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_85|))) is different from true [2022-11-16 12:48:13,163 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (v_ArrVal_5509 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_85| Int) (v_ArrVal_5491 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_84| Int) (v_ArrVal_5502 Int) (v_ArrVal_5498 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_84|) (= |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_84| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5491) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5498) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5502) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5509))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_85|))) is different from true [2022-11-16 12:48:13,213 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (v_ArrVal_5509 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_85| Int) (v_ArrVal_5491 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_84| Int) (v_ArrVal_5502 Int) (v_ArrVal_5513 Int) (v_ArrVal_5498 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 2) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_84|) (= (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_84| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5491) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5498) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5502) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5509) (+ (- 1) |c_#Ultimate.C_memcpy_dest.offset| |c_#Ultimate.C_memcpy_#t~loopctr1316|) v_ArrVal_5513)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_85|))) is different from true [2022-11-16 12:48:13,278 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (v_ArrVal_5509 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_85| Int) (v_ArrVal_5491 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_84| Int) (v_ArrVal_5502 Int) (v_ArrVal_5513 Int) (v_ArrVal_5521 Int) (v_ArrVal_5498 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_84|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 2) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5491) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_85| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5498) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5502) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5509) (+ (- 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5513) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5521))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_84| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_85|))) is different from true [2022-11-16 12:48:14,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:14,450 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 12:48:14,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 79 [2022-11-16 12:48:14,571 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:48:14,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-16 12:48:15,755 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 12:48:15,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 12:48:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 21 not checked. [2022-11-16 12:48:15,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:26,812 WARN L233 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 194 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 12:48:41,169 WARN L233 SmtUtils]: Spent 11.74s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:48:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39487963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:41,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:48:41,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 60 [2022-11-16 12:48:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846319870] [2022-11-16 12:48:41,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:41,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-16 12:48:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:41,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-16 12:48:41,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3757, Unknown=9, NotChecked=762, Total=4692 [2022-11-16 12:48:41,174 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand has 60 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 47 states have internal predecessors, (114), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 12:48:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:55,176 INFO L93 Difference]: Finished difference Result 189 states and 223 transitions. [2022-11-16 12:48:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 12:48:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 47 states have internal predecessors, (114), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 139 [2022-11-16 12:48:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:55,178 INFO L225 Difference]: With dead ends: 189 [2022-11-16 12:48:55,178 INFO L226 Difference]: Without dead ends: 134 [2022-11-16 12:48:55,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=377, Invalid=8559, Unknown=18, NotChecked=1146, Total=10100 [2022-11-16 12:48:55,180 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 183 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 5035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1330 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:55,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1727 Invalid, 5035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 3542 Invalid, 0 Unknown, 1330 Unchecked, 5.3s Time] [2022-11-16 12:48:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-16 12:48:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-11-16 12:48:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 87 states have internal predecessors, (93), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:48:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2022-11-16 12:48:55,204 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 139 [2022-11-16 12:48:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:55,205 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2022-11-16 12:48:55,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 47 states have internal predecessors, (114), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 12:48:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2022-11-16 12:48:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-16 12:48:55,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:55,207 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-16 12:48:55,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:55,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:48:55,421 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:48:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash 775625794, now seen corresponding path program 7 times [2022-11-16 12:48:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:55,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751226120] [2022-11-16 12:48:55,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:48:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:48:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:48:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:48:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:48:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:48:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:48:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:48:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:48:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:48:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:48:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:48:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:48:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:48:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:48:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:48:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:48:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:57,100 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-16 12:48:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751226120] [2022-11-16 12:48:57,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751226120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938892285] [2022-11-16 12:48:57,100 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:48:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:57,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:57,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:48:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:58,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 3468 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-16 12:48:58,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:59,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:48:59,239 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (v_ArrVal_6630 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0)) (= |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_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630))) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-11-16 12:48:59,271 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6637 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_6630 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0)) (= |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|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6637))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_110|)))) is different from true [2022-11-16 12:48:59,314 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6637 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_6630 Int) (v_ArrVal_6641 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_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 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6637) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6641))) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_110|)))) is different from true [2022-11-16 12:48:59,370 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6637 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_6630 Int) (v_ArrVal_6641 Int) (v_ArrVal_6650 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .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_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6637) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6641) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6650)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_110|)))) is different from true [2022-11-16 12:48:59,439 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6637 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_6655 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_6630 Int) (v_ArrVal_6641 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_6650 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0)) (= (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_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6637) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6641) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6650) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6655)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_110|)))) is different from true [2022-11-16 12:48:59,811 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6637 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (v_ArrVal_6657 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_6655 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_6630 Int) (v_ArrVal_6641 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_6650 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_47| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6637) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6641) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6650) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6655) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6657))) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_47| 8) |c_#Ultimate.C_memcpy_#t~loopctr1325|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_47|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_110|)))) is different from true [2022-11-16 12:48:59,938 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6637 Int) (v_ArrVal_6659 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (v_ArrVal_6657 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_6655 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_6630 Int) (v_ArrVal_6641 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (v_ArrVal_6650 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_48| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1325_47| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_47| 8) |v_#Ultimate.C_memcpy_#t~loopctr1325_48|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_6630) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6637) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6641) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6650) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6655) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6657) (+ |v_#Ultimate.C_memcpy_#t~loopctr1325_48| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6659)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1325_47|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_109_68| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_110|)))) is different from true [2022-11-16 12:49:00,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:00,392 INFO L321 Elim1Store]: treesize reduction 173, result has 34.7 percent of original size [2022-11-16 12:49:00,392 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-16 12:49:00,538 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:49:00,539 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-16 12:49:01,574 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 12:49:01,575 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-16 12:49:01,742 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-16 12:49:01,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:49:09,522 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 12:50:00,155 WARN L233 SmtUtils]: Spent 16.37s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:50:00,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938892285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:00,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:50:00,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 42] total 54 [2022-11-16 12:50:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969217648] [2022-11-16 12:50:00,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:00,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 12:50:00,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:00,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 12:50:00,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2933, Unknown=16, NotChecked=798, Total=3906 [2022-11-16 12:50:00,164 INFO L87 Difference]: Start difference. First operand 133 states and 155 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-16 12:50:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:50:18,422 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2022-11-16 12:50:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 12:50:18,423 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-16 12:50:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:50:18,425 INFO L225 Difference]: With dead ends: 187 [2022-11-16 12:50:18,425 INFO L226 Difference]: Without dead ends: 134 [2022-11-16 12:50:18,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=347, Invalid=6626, Unknown=27, NotChecked=1190, Total=8190 [2022-11-16 12:50:18,427 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 214 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 3386 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 5028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 3386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1456 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:50:18,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1257 Invalid, 5028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 3386 Invalid, 0 Unknown, 1456 Unchecked, 4.9s Time] [2022-11-16 12:50:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-16 12:50:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-11-16 12:50:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 86 states have internal predecessors, (91), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-16 12:50:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2022-11-16 12:50:18,449 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 139 [2022-11-16 12:50:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:50:18,450 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2022-11-16 12:50:18,450 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-16 12:50:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-11-16 12:50:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-16 12:50:18,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:50:18,451 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-16 12:50:18,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:50:18,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:50:18,654 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:50:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1913440102, now seen corresponding path program 8 times [2022-11-16 12:50:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315400892] [2022-11-16 12:50:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:50:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:50:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:50:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:50:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:50:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:50:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:50:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:50:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:50:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:50:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:50:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:50:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:50:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:50:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 12:50:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:50:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 12:50:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:50:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:50:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:50:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:50:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-16 12:50:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:23,879 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-16 12:50:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:23,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315400892] [2022-11-16 12:50:23,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315400892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:23,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82817470] [2022-11-16 12:50:23,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:50:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:23,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:23,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055b0d0d-491a-40f2-adfd-b8fcb9fb5f13/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:50:25,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:50:25,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:50:25,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 3713 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-16 12:50:25,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:55,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:50:58,391 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8097 Int) (v_ArrVal_8100 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|))) is different from true [2022-11-16 12:50:58,419 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8097 Int) (v_ArrVal_8100 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_134| Int) (v_ArrVal_8108 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8108)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_134|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|))) is different from true [2022-11-16 12:50:58,491 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8097 Int) (v_ArrVal_8100 Int) (v_ArrVal_8116 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_134| Int) (v_ArrVal_8108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_135|) (= (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_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8116)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_134|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|))) is different from true [2022-11-16 12:50:58,534 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8097 Int) (v_ArrVal_8100 Int) (v_ArrVal_8122 Int) (v_ArrVal_8116 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_134| Int) (v_ArrVal_8108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_135| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_136| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_135|) (= (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_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8116) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8122)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_134|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_136|))) is different from true [2022-11-16 12:50:58,595 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8097 Int) (v_ArrVal_8100 Int) (v_ArrVal_8122 Int) (v_ArrVal_8116 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_134| Int) (v_ArrVal_8108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_135| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_136| Int) (v_ArrVal_8124 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_137| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_135|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8116) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8122) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8124))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_137|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_137| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_136|))) is different from true [2022-11-16 12:50:58,668 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8116 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_134| Int) (v_ArrVal_8108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_135| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_136| Int) (v_ArrVal_8124 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_137| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_138| Int) (v_ArrVal_8097 Int) (v_ArrVal_8130 Int) (v_ArrVal_8100 Int) (v_ArrVal_8122 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_137| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_138|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8116) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8122) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8124) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_138| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8130)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_137|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_136|))) is different from true [2022-11-16 12:51:02,732 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8116 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_134| Int) (v_ArrVal_8108 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_135| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_136| Int) (v_ArrVal_8124 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_137| Int) (v_ArrVal_8136 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_138| Int) (v_ArrVal_8097 Int) (v_ArrVal_8130 Int) (v_ArrVal_8100 Int) (v_ArrVal_8122 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_135|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_8097) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8100) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8108) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8116) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8122) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8124) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_138| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8130) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_8136)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_137| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_138|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_137|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_136|))) is different from true [2022-11-16 12:51:02,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:51:02,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 82 [2022-11-16 12:51:02,943 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 88 treesize of output 73 [2022-11-16 12:51:02,978 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:51:02,978 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 72 treesize of output 103 [2022-11-16 12:51:24,991 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-11-16 12:51:24,991 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 171 treesize of output 112 [2022-11-16 12:51:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 83 trivial. 28 not checked. [2022-11-16 12:51:27,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:52:04,207 WARN L233 SmtUtils]: Spent 14.56s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 12:52:28,901 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 168 DAG size of output: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:52:28,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82817470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:52:28,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:52:28,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39] total 65 [2022-11-16 12:52:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921431281] [2022-11-16 12:52:28,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:52:28,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 12:52:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:52:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 12:52:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=4225, Unknown=50, NotChecked=952, Total=5402 [2022-11-16 12:52:28,908 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 65 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)