./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/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_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/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_b2d57608-ef7e-43c8-86e6-6fc070074886/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 44162e1142387f3513ac3cf9af71d3c7aa6399e99cd364d08a07ceb8efc80a41 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:46:15,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:46:15,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:46:15,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:46:15,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:46:15,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:46:15,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:46:15,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:46:15,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:46:15,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:46:15,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:46:15,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:46:15,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:46:15,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:46:15,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:46:15,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:46:15,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:46:15,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:46:15,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:46:15,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:46:15,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:46:15,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:46:15,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:46:15,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:46:15,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:46:15,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:46:15,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:46:15,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:46:15,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:46:15,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:46:15,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:46:15,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:46:15,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:46:15,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:46:15,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:46:15,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:46:15,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:46:15,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:46:15,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:46:15,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:46:15,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:46:15,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:46:15,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:46:15,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:46:15,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:46:15,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:46:15,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:46:15,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:46:15,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:46:15,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:46:15,700 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:46:15,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:46:15,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:46:15,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:46:15,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:46:15,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:46:15,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:46:15,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:46:15,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:46:15,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:46:15,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:46:15,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:46:15,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:46:15,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:46:15,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:46:15,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:46:15,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:46:15,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:46:15,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:46:15,706 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:46:15,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:46:15,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:46:15,707 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_b2d57608-ef7e-43c8-86e6-6fc070074886/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_b2d57608-ef7e-43c8-86e6-6fc070074886/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 -> 44162e1142387f3513ac3cf9af71d3c7aa6399e99cd364d08a07ceb8efc80a41 [2022-11-16 11:46:15,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:46:16,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:46:16,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:46:16,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:46:16,038 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:46:16,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i [2022-11-16 11:46:16,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/data/9c966b4a8/f2cc7b2f941a4ce8b7cc2b5ff521fe56/FLAG2a8d3bdd4 [2022-11-16 11:46:17,077 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:46:17,077 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i [2022-11-16 11:46:17,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/data/9c966b4a8/f2cc7b2f941a4ce8b7cc2b5ff521fe56/FLAG2a8d3bdd4 [2022-11-16 11:46:17,516 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/data/9c966b4a8/f2cc7b2f941a4ce8b7cc2b5ff521fe56 [2022-11-16 11:46:17,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:46:17,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:46:17,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:46:17,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:46:17,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:46:17,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:17" (1/1) ... [2022-11-16 11:46:17,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9612e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:17, skipping insertion in model container [2022-11-16 11:46:17,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:17" (1/1) ... [2022-11-16 11:46:17,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:46:17,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:46:18,141 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_b2d57608-ef7e-43c8-86e6-6fc070074886/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4496,4509] [2022-11-16 11:46:18,151 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_b2d57608-ef7e-43c8-86e6-6fc070074886/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4556,4569] [2022-11-16 11:46:19,367 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,376 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,377 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,378 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,380 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,397 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,398 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,401 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,407 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,413 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,415 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,416 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:19,416 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,036 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:46:20,039 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:46:20,042 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:46:20,044 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:46:20,045 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:46:20,047 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:46:20,048 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:46:20,049 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:46:20,050 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:46:20,052 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:46:20,325 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:46:20,846 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,847 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,899 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,902 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,911 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,913 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,944 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,945 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,945 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,947 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,947 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,948 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:20,948 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:46:21,058 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:46:21,075 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_b2d57608-ef7e-43c8-86e6-6fc070074886/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4496,4509] [2022-11-16 11:46:21,076 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_b2d57608-ef7e-43c8-86e6-6fc070074886/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4556,4569] [2022-11-16 11:46:21,116 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,117 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,118 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,118 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,119 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,126 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,127 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,128 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,129 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,130 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,131 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,132 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,132 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,168 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:46:21,169 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:46:21,170 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:46:21,171 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:46:21,173 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:46:21,174 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:46:21,174 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:46:21,175 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:46:21,176 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:46:21,176 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:46:21,202 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:46:21,290 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,290 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,298 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,299 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,302 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,303 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,312 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,313 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,314 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,314 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,314 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,315 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,315 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:46:21,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:46:21,776 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:46:21,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21 WrapperNode [2022-11-16 11:46:21,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:46:21,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:46:21,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:46:21,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:46:21,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:21,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,099 INFO L138 Inliner]: procedures = 775, calls = 2435, calls flagged for inlining = 69, calls inlined = 18, statements flattened = 938 [2022-11-16 11:46:22,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:46:22,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:46:22,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:46:22,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:46:22,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,257 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:46:22,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:46:22,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:46:22,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:46:22,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (1/1) ... [2022-11-16 11:46:22,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:46:22,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:22,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:46:22,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:46:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-16 11:46:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:46:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-16 11:46:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-16 11:46:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:46:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:46:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-16 11:46:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-16 11:46:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:46:22,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-16 11:46:22,414 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-16 11:46:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-16 11:46:22,414 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-16 11:46:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 11:46:22,415 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 11:46:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:46:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-16 11:46:22,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-16 11:46:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:46:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 11:46:22,416 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 11:46:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:46:22,416 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-16 11:46:22,417 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-16 11:46:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-11-16 11:46:22,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-11-16 11:46:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:46:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-16 11:46:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-16 11:46:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 11:46:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 11:46:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-11-16 11:46:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-11-16 11:46:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure s_get_next_element [2022-11-16 11:46:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure s_get_next_element [2022-11-16 11:46:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:46:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_int [2022-11-16 11:46:22,420 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_int [2022-11-16 11:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2022-11-16 11:46:22,420 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2022-11-16 11:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-16 11:46:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-16 11:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-16 11:46:22,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-16 11:46:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-16 11:46:22,422 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-16 11:46:22,422 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2022-11-16 11:46:22,423 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2022-11-16 11:46:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-16 11:46:22,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-16 11:46:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:46:22,907 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:46:22,910 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:46:23,277 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !true; [2022-11-16 11:46:23,277 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-11-16 11:46:24,484 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !true; [2022-11-16 11:46:24,512 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:46:24,522 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:46:24,523 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-16 11:46:24,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:46:24 BoogieIcfgContainer [2022-11-16 11:46:24,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:46:24,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:46:24,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:46:24,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:46:24,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:46:17" (1/3) ... [2022-11-16 11:46:24,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8433e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:24, skipping insertion in model container [2022-11-16 11:46:24,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:21" (2/3) ... [2022-11-16 11:46:24,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8433e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:24, skipping insertion in model container [2022-11-16 11:46:24,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:46:24" (3/3) ... [2022-11-16 11:46:24,536 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_table_foreach_harness.i [2022-11-16 11:46:24,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:46:24,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:46:24,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:46:24,636 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;@3c7fb454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:46:24,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:46:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 187 states have (on average 1.267379679144385) internal successors, (237), 184 states have internal predecessors, (237), 81 states have call successors, (81), 22 states have call predecessors, (81), 22 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-11-16 11:46:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 11:46:24,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:24,661 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:24,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1669380125, now seen corresponding path program 1 times [2022-11-16 11:46:24,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:24,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367439362] [2022-11-16 11:46:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:25,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367439362] [2022-11-16 11:46:25,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-16 11:46:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748164828] [2022-11-16 11:46:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:25,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:25,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:25,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:25,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:46:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:26,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:46:26,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-16 11:46:26,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:26,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748164828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:26,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:26,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:26,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139987579] [2022-11-16 11:46:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:26,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:46:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:46:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:46:26,256 INFO L87 Difference]: Start difference. First operand has 288 states, 187 states have (on average 1.267379679144385) internal successors, (237), 184 states have internal predecessors, (237), 81 states have call successors, (81), 22 states have call predecessors, (81), 22 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 11:46:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:26,385 INFO L93 Difference]: Finished difference Result 567 states and 831 transitions. [2022-11-16 11:46:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:46:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-11-16 11:46:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:26,409 INFO L225 Difference]: With dead ends: 567 [2022-11-16 11:46:26,410 INFO L226 Difference]: Without dead ends: 282 [2022-11-16 11:46:26,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:46:26,430 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:26,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:46:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-16 11:46:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-16 11:46:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 178 states have (on average 1.2303370786516854) internal successors, (219), 179 states have internal predecessors, (219), 81 states have call successors, (81), 22 states have call predecessors, (81), 22 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-16 11:46:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 380 transitions. [2022-11-16 11:46:26,558 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 380 transitions. Word has length 120 [2022-11-16 11:46:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:26,558 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 380 transitions. [2022-11-16 11:46:26,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 11:46:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 380 transitions. [2022-11-16 11:46:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-16 11:46:26,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:26,574 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:26,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:26,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 11:46:26,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash -262655291, now seen corresponding path program 1 times [2022-11-16 11:46:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:26,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976147398] [2022-11-16 11:46:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:26,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:46:26,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718079539] [2022-11-16 11:46:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:26,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:26,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:26,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:26,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:46:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:46:27,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-16 11:46:28,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-16 11:46:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:28,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976147398] [2022-11-16 11:46:28,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:46:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718079539] [2022-11-16 11:46:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718079539] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:28,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:46:28,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2022-11-16 11:46:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031718864] [2022-11-16 11:46:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:46:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:46:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:46:28,407 INFO L87 Difference]: Start difference. First operand 282 states and 380 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-16 11:46:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:28,976 INFO L93 Difference]: Finished difference Result 512 states and 707 transitions. [2022-11-16 11:46:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:46:28,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 126 [2022-11-16 11:46:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:28,993 INFO L225 Difference]: With dead ends: 512 [2022-11-16 11:46:28,993 INFO L226 Difference]: Without dead ends: 299 [2022-11-16 11:46:28,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:46:28,996 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 408 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:28,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1675 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:46:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-16 11:46:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-11-16 11:46:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 190 states have internal predecessors, (231), 86 states have call successors, (86), 23 states have call predecessors, (86), 24 states have return successors, (92), 85 states have call predecessors, (92), 85 states have call successors, (92) [2022-11-16 11:46:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2022-11-16 11:46:29,029 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 126 [2022-11-16 11:46:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:29,030 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2022-11-16 11:46:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-16 11:46:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2022-11-16 11:46:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-16 11:46:29,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:29,033 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:29,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:29,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-16 11:46:29,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1695610635, now seen corresponding path program 1 times [2022-11-16 11:46:29,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:29,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83851317] [2022-11-16 11:46:29,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:29,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:46:29,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757578253] [2022-11-16 11:46:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:29,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:29,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:29,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:29,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:46:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:30,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:46:30,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-16 11:46:30,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:30,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83851317] [2022-11-16 11:46:30,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:46:30,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757578253] [2022-11-16 11:46:30,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757578253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:30,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:30,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:46:30,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112605227] [2022-11-16 11:46:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:30,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:46:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:46:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:46:30,142 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 11:46:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:30,219 INFO L93 Difference]: Finished difference Result 558 states and 771 transitions. [2022-11-16 11:46:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:46:30,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-11-16 11:46:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:30,223 INFO L225 Difference]: With dead ends: 558 [2022-11-16 11:46:30,223 INFO L226 Difference]: Without dead ends: 304 [2022-11-16 11:46:30,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:30,226 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:30,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1503 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:46:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-16 11:46:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-16 11:46:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 192 states have (on average 1.2239583333333333) internal successors, (235), 194 states have internal predecessors, (235), 86 states have call successors, (86), 23 states have call predecessors, (86), 25 states have return successors, (93), 86 states have call predecessors, (93), 85 states have call successors, (93) [2022-11-16 11:46:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 414 transitions. [2022-11-16 11:46:30,255 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 414 transitions. Word has length 127 [2022-11-16 11:46:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:30,255 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 414 transitions. [2022-11-16 11:46:30,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 11:46:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 414 transitions. [2022-11-16 11:46:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-16 11:46:30,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:30,258 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:30,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:30,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:30,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 818445258, now seen corresponding path program 1 times [2022-11-16 11:46:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:30,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324231759] [2022-11-16 11:46:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:46:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:46:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:46:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:46:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:46:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:46:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:46:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:46:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:46:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-16 11:46:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:46:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:46:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:46:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-16 11:46:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:33,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324231759] [2022-11-16 11:46:33,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324231759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:33,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359845503] [2022-11-16 11:46:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:33,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:33,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:46:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:33,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 2450 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 11:46:33,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:34,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:46:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-16 11:46:34,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:34,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359845503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:34,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:46:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2022-11-16 11:46:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875836284] [2022-11-16 11:46:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:34,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:46:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:46:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:46:34,565 INFO L87 Difference]: Start difference. First operand 304 states and 414 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-16 11:46:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:34,684 INFO L93 Difference]: Finished difference Result 556 states and 768 transitions. [2022-11-16 11:46:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:46:34,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 133 [2022-11-16 11:46:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:34,688 INFO L225 Difference]: With dead ends: 556 [2022-11-16 11:46:34,688 INFO L226 Difference]: Without dead ends: 313 [2022-11-16 11:46:34,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:46:34,691 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 18 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:34,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2180 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-11-16 11:46:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-16 11:46:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-11-16 11:46:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 200 states have (on average 1.225) internal successors, (245), 202 states have internal predecessors, (245), 86 states have call successors, (86), 24 states have call predecessors, (86), 26 states have return successors, (94), 86 states have call predecessors, (94), 85 states have call successors, (94) [2022-11-16 11:46:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 425 transitions. [2022-11-16 11:46:34,716 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 425 transitions. Word has length 133 [2022-11-16 11:46:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:34,717 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 425 transitions. [2022-11-16 11:46:34,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-16 11:46:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 425 transitions. [2022-11-16 11:46:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-16 11:46:34,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:34,719 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 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 11:46:34,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:34,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:34,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1772385416, now seen corresponding path program 1 times [2022-11-16 11:46:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:34,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111749325] [2022-11-16 11:46:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:46:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:46:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:46:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:46:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:46:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:46:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:46:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:46:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:46:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-16 11:46:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:46:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:46:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:46:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-16 11:46:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:35,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111749325] [2022-11-16 11:46:35,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111749325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:35,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672016364] [2022-11-16 11:46:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:35,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:35,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:35,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:35,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:46:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:36,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 2445 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:46:36,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-16 11:46:36,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:36,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672016364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:36,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:46:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-11-16 11:46:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001835241] [2022-11-16 11:46:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:36,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:46:36,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:36,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:46:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:46:36,798 INFO L87 Difference]: Start difference. First operand 313 states and 425 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-16 11:46:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:37,206 INFO L93 Difference]: Finished difference Result 560 states and 778 transitions. [2022-11-16 11:46:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:46:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 133 [2022-11-16 11:46:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:37,210 INFO L225 Difference]: With dead ends: 560 [2022-11-16 11:46:37,211 INFO L226 Difference]: Without dead ends: 315 [2022-11-16 11:46:37,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:46:37,213 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 415 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:37,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 921 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:46:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-16 11:46:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-11-16 11:46:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 203 states have internal predecessors, (245), 87 states have call successors, (87), 24 states have call predecessors, (87), 26 states have return successors, (98), 87 states have call predecessors, (98), 86 states have call successors, (98) [2022-11-16 11:46:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 430 transitions. [2022-11-16 11:46:37,244 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 430 transitions. Word has length 133 [2022-11-16 11:46:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:37,244 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 430 transitions. [2022-11-16 11:46:37,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-16 11:46:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 430 transitions. [2022-11-16 11:46:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-16 11:46:37,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:37,247 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 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 11:46:37,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:37,464 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1889144309, now seen corresponding path program 1 times [2022-11-16 11:46:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:37,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597832269] [2022-11-16 11:46:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:46:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:46:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:46:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:46:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:46:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:46:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:46:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:46:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:46:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:46:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 11:46:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:46:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:46:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 11:46:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:46:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-16 11:46:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:38,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597832269] [2022-11-16 11:46:38,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597832269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:38,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872681030] [2022-11-16 11:46:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:38,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:38,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:38,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:46:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:39,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:46:39,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:41,914 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-11-16 11:46:50,003 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:46:58,085 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:46:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-16 11:46:58,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:58,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872681030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:58,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:46:58,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-11-16 11:46:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611870663] [2022-11-16 11:46:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:58,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:46:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:46:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=202, Unknown=3, NotChecked=28, Total=272 [2022-11-16 11:46:58,121 INFO L87 Difference]: Start difference. First operand 315 states and 430 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-16 11:46:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:58,603 INFO L93 Difference]: Finished difference Result 567 states and 804 transitions. [2022-11-16 11:46:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:46:58,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 139 [2022-11-16 11:46:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:58,606 INFO L225 Difference]: With dead ends: 567 [2022-11-16 11:46:58,606 INFO L226 Difference]: Without dead ends: 318 [2022-11-16 11:46:58,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=54, Invalid=253, Unknown=3, NotChecked=32, Total=342 [2022-11-16 11:46:58,608 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 5 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 515 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:58,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2092 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 515 Unchecked, 0.3s Time] [2022-11-16 11:46:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-16 11:46:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2022-11-16 11:46:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 203 states have (on average 1.2167487684729064) internal successors, (247), 204 states have internal predecessors, (247), 87 states have call successors, (87), 25 states have call predecessors, (87), 26 states have return successors, (98), 87 states have call predecessors, (98), 86 states have call successors, (98) [2022-11-16 11:46:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 432 transitions. [2022-11-16 11:46:58,637 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 432 transitions. Word has length 139 [2022-11-16 11:46:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:58,637 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 432 transitions. [2022-11-16 11:46:58,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-16 11:46:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 432 transitions. [2022-11-16 11:46:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-16 11:46:58,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:58,640 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:58,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:58,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:58,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash -817837060, now seen corresponding path program 1 times [2022-11-16 11:46:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:58,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353967535] [2022-11-16 11:46:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:47:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:47:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:47:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:47:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:47:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:47:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:47:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:47:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:47:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:47:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:47:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:47:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:47:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 11:47:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:47:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353967535] [2022-11-16 11:47:02,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353967535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:02,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:02,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-16 11:47:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611042729] [2022-11-16 11:47:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:02,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:47:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:47:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:47:02,157 INFO L87 Difference]: Start difference. First operand 317 states and 432 transitions. Second operand has 18 states, 16 states have (on average 4.375) internal successors, (70), 13 states have internal predecessors, (70), 8 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-16 11:47:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:07,317 INFO L93 Difference]: Finished difference Result 573 states and 800 transitions. [2022-11-16 11:47:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:47:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.375) internal successors, (70), 13 states have internal predecessors, (70), 8 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 144 [2022-11-16 11:47:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:07,321 INFO L225 Difference]: With dead ends: 573 [2022-11-16 11:47:07,321 INFO L226 Difference]: Without dead ends: 345 [2022-11-16 11:47:07,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:47:07,326 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 741 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 3645 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 3645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:07,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1663 Invalid, 4219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [574 Valid, 3645 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-16 11:47:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-16 11:47:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 326. [2022-11-16 11:47:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 209 states have (on average 1.2200956937799043) internal successors, (255), 211 states have internal predecessors, (255), 89 states have call successors, (89), 25 states have call predecessors, (89), 27 states have return successors, (109), 89 states have call predecessors, (109), 88 states have call successors, (109) [2022-11-16 11:47:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 453 transitions. [2022-11-16 11:47:07,366 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 453 transitions. Word has length 144 [2022-11-16 11:47:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 453 transitions. [2022-11-16 11:47:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.375) internal successors, (70), 13 states have internal predecessors, (70), 8 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-16 11:47:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 453 transitions. [2022-11-16 11:47:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-16 11:47:07,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:07,370 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:07,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:47:07,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:47:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash -951850566, now seen corresponding path program 1 times [2022-11-16 11:47:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:07,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096663469] [2022-11-16 11:47:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:47:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:47:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:47:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:47:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:47:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:47:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:47:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:47:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:47:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:47:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:47:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:47:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:47:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 11:47:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-16 11:47:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:10,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096663469] [2022-11-16 11:47:10,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096663469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:10,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004325721] [2022-11-16 11:47:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:10,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:10,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:10,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:47:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:11,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:47:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:11,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 11:47:11,730 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 15 treesize of output 7 [2022-11-16 11:47:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-16 11:47:11,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:47:11,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004325721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:11,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:47:11,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 29 [2022-11-16 11:47:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380238854] [2022-11-16 11:47:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:11,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:47:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:47:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-11-16 11:47:11,866 INFO L87 Difference]: Start difference. First operand 326 states and 453 transitions. Second operand has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-16 11:47:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:13,465 INFO L93 Difference]: Finished difference Result 635 states and 879 transitions. [2022-11-16 11:47:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:47:13,466 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 144 [2022-11-16 11:47:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:13,474 INFO L225 Difference]: With dead ends: 635 [2022-11-16 11:47:13,474 INFO L226 Difference]: Without dead ends: 376 [2022-11-16 11:47:13,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=1330, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 11:47:13,478 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 494 mSDsluCounter, 3125 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:13,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 3503 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 698 Invalid, 0 Unknown, 97 Unchecked, 1.3s Time] [2022-11-16 11:47:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-16 11:47:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2022-11-16 11:47:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 246 states have (on average 1.2276422764227641) internal successors, (302), 247 states have internal predecessors, (302), 91 states have call successors, (91), 33 states have call predecessors, (91), 34 states have return successors, (101), 91 states have call predecessors, (101), 90 states have call successors, (101) [2022-11-16 11:47:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 494 transitions. [2022-11-16 11:47:13,542 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 494 transitions. Word has length 144 [2022-11-16 11:47:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:13,545 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 494 transitions. [2022-11-16 11:47:13,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-16 11:47:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 494 transitions. [2022-11-16 11:47:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-16 11:47:13,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:13,549 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:13,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:13,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:13,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:47:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2132172247, now seen corresponding path program 1 times [2022-11-16 11:47:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607282384] [2022-11-16 11:47:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:47:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:47:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:47:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:47:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:47:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:47:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:47:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:47:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:47:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:47:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 11:47:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-16 11:47:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 11:47:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:47:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607282384] [2022-11-16 11:47:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607282384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:17,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:17,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-16 11:47:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536231770] [2022-11-16 11:47:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:17,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:47:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:17,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:47:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:47:17,337 INFO L87 Difference]: Start difference. First operand 372 states and 494 transitions. Second operand has 19 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 9 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2022-11-16 11:47:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:22,349 INFO L93 Difference]: Finished difference Result 623 states and 855 transitions. [2022-11-16 11:47:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:47:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 9 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) Word has length 148 [2022-11-16 11:47:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:22,355 INFO L225 Difference]: With dead ends: 623 [2022-11-16 11:47:22,355 INFO L226 Difference]: Without dead ends: 400 [2022-11-16 11:47:22,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:47:22,358 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 418 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:22,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1479 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-16 11:47:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-16 11:47:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 372. [2022-11-16 11:47:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 246 states have (on average 1.2276422764227641) internal successors, (302), 247 states have internal predecessors, (302), 91 states have call successors, (91), 33 states have call predecessors, (91), 34 states have return successors, (101), 91 states have call predecessors, (101), 90 states have call successors, (101) [2022-11-16 11:47:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 494 transitions. [2022-11-16 11:47:22,441 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 494 transitions. Word has length 148 [2022-11-16 11:47:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:22,442 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 494 transitions. [2022-11-16 11:47:22,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 9 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2022-11-16 11:47:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 494 transitions. [2022-11-16 11:47:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-16 11:47:22,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:22,447 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:22,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:47:22,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:47:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash -737363795, now seen corresponding path program 1 times [2022-11-16 11:47:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:22,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848896728] [2022-11-16 11:47:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:47:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:47:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:47:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:47:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:47:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:25,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:47:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:47:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:47:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:47:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:47:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:47:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:47:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:47:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 11:47:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-11-16 11:47:26,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:26,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848896728] [2022-11-16 11:47:26,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848896728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:26,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110447334] [2022-11-16 11:47:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:26,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:26,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:26,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:26,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:47:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:27,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:47:27,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-16 11:47:27,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:47:27,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110447334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:27,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:47:27,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-11-16 11:47:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630183516] [2022-11-16 11:47:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:27,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:47:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:47:27,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:47:27,483 INFO L87 Difference]: Start difference. First operand 372 states and 494 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-16 11:47:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:27,803 INFO L93 Difference]: Finished difference Result 685 states and 921 transitions. [2022-11-16 11:47:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:47:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 153 [2022-11-16 11:47:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:27,808 INFO L225 Difference]: With dead ends: 685 [2022-11-16 11:47:27,808 INFO L226 Difference]: Without dead ends: 384 [2022-11-16 11:47:27,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:47:27,814 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 2 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:27,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2084 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:47:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-16 11:47:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 375. [2022-11-16 11:47:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 248 states have (on average 1.2258064516129032) internal successors, (304), 250 states have internal predecessors, (304), 91 states have call successors, (91), 33 states have call predecessors, (91), 35 states have return successors, (104), 91 states have call predecessors, (104), 90 states have call successors, (104) [2022-11-16 11:47:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 499 transitions. [2022-11-16 11:47:27,869 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 499 transitions. Word has length 153 [2022-11-16 11:47:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:27,870 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 499 transitions. [2022-11-16 11:47:27,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-16 11:47:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 499 transitions. [2022-11-16 11:47:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-16 11:47:27,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:27,874 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:27,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:47:28,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:47:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash 538022179, now seen corresponding path program 2 times [2022-11-16 11:47:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:28,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85134457] [2022-11-16 11:47:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:47:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:47:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:47:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:47:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:47:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:47:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:47:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:47:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:47:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:47:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:47:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:33,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:47:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 11:47:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-16 11:47:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-11-16 11:47:34,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85134457] [2022-11-16 11:47:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85134457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262202444] [2022-11-16 11:47:34,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:47:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:34,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:34,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:34,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:47:35,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:47:35,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:47:35,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 2585 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:47:35,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-16 11:47:35,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:47:35,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262202444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:35,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:47:35,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2022-11-16 11:47:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235807934] [2022-11-16 11:47:35,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:35,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:47:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:35,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:47:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2022-11-16 11:47:35,629 INFO L87 Difference]: Start difference. First operand 375 states and 499 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-16 11:47:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:47:35,976 INFO L93 Difference]: Finished difference Result 670 states and 907 transitions. [2022-11-16 11:47:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:47:35,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 164 [2022-11-16 11:47:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:47:35,984 INFO L225 Difference]: With dead ends: 670 [2022-11-16 11:47:35,985 INFO L226 Difference]: Without dead ends: 384 [2022-11-16 11:47:35,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2022-11-16 11:47:35,988 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 2 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:47:35,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2086 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:47:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-16 11:47:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2022-11-16 11:47:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 250 states have (on average 1.224) internal successors, (306), 253 states have internal predecessors, (306), 91 states have call successors, (91), 33 states have call predecessors, (91), 36 states have return successors, (104), 91 states have call predecessors, (104), 90 states have call successors, (104) [2022-11-16 11:47:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 501 transitions. [2022-11-16 11:47:36,044 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 501 transitions. Word has length 164 [2022-11-16 11:47:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:47:36,045 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 501 transitions. [2022-11-16 11:47:36,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-16 11:47:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 501 transitions. [2022-11-16 11:47:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-16 11:47:36,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:47:36,051 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:47:36,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:47:36,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:36,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:47:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2001607967, now seen corresponding path program 3 times [2022-11-16 11:47:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:36,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163448112] [2022-11-16 11:47:36,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:47:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:47:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:47:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:47:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:47:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:47:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:47:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:47:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:47:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:47:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:47:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:47:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:47:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:47:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:47:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:47:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:47:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-16 11:47:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 11:47:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:47:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:47:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163448112] [2022-11-16 11:47:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163448112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:47:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953365742] [2022-11-16 11:47:42,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:47:42,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:47:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:47:42,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:47:42,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:47:43,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:47:43,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:47:43,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 2062 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-16 11:47:43,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:44,032 INFO L321 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-11-16 11:47:44,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 86 [2022-11-16 11:47:44,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:44,093 INFO L321 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2022-11-16 11:47:44,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 53 treesize of output 69 [2022-11-16 11:47:44,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:47:44,147 INFO L321 Elim1Store]: treesize reduction 64, result has 36.0 percent of original size [2022-11-16 11:47:44,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 74 treesize of output 78 [2022-11-16 11:47:44,185 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:47:44,185 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 56 [2022-11-16 11:47:44,209 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 13 treesize of output 9 [2022-11-16 11:47:44,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 36 [2022-11-16 11:47:44,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 15 [2022-11-16 11:48:29,128 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:48:31,742 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 32)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 32) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 0) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11)))) is different from true [2022-11-16 11:48:44,019 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:48:54,138 WARN L233 SmtUtils]: Spent 9.82s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:02,587 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:12,904 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:14,952 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 32)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 32) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 0) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11)))) (or (exists ((|v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1|) |v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1|) |v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1|) 0))))) is different from true [2022-11-16 11:49:29,510 WARN L233 SmtUtils]: Spent 14.29s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:46,761 WARN L233 SmtUtils]: Spent 16.69s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:48,864 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 32)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 32) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 0) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11)))) (or (exists ((|v_hash_table_state_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_hash_table_state_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (<= 2 (mod (select (select |c_#memory_int| |v_hash_table_state_is_valid_#in~map.base_BEFORE_CALL_1|) (+ 40 |v_hash_table_state_is_valid_#in~map.offset_BEFORE_CALL_1|)) 18446744073709551616))) (exists ((|v_hash_table_state_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_hash_table_state_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (<= 2 (mod (select (select |c_#memory_int| |v_hash_table_state_is_valid_#in~map.base_BEFORE_CALL_1|) (+ 40 |v_hash_table_state_is_valid_#in~map.offset_BEFORE_CALL_1|)) 18446744073709551616))))) (or (exists ((|v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1|) |v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1|) |v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1|) 0))))) is different from true [2022-11-16 11:50:24,105 WARN L233 SmtUtils]: Spent 32.23s on a formula simplification. DAG size of input: 74 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:00,655 WARN L233 SmtUtils]: Spent 36.17s on a formula simplification. DAG size of input: 64 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:15,803 WARN L233 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 70 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:22,406 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:31,284 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:33,956 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 32) (select (select |c_#memory_int| .cse0) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)))) (not (= .cse0 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_12) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (and (not (= .cse3 0)) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 32) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (+ 40 .cse3))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (and (= 32 .cse6) (= .cse7 v_s_get_next_element_~iter.base_BEFORE_CALL_12) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) .cse6) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0)) (= 32 .cse9) (= .cse8 v_s_get_next_element_~iter.base_BEFORE_CALL_12) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) is different from true [2022-11-16 11:51:46,844 WARN L233 SmtUtils]: Spent 12.55s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:48,932 WARN L855 $PredicateComparison]: unable to prove that (and (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 32) (select (select |c_#memory_int| .cse0) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)))) (not (= .cse0 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_12) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (and (not (= .cse3 0)) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 32) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (+ 40 .cse3))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (and (= 32 .cse6) (= .cse7 v_s_get_next_element_~iter.base_BEFORE_CALL_12) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) .cse6) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0)) (= 32 .cse9) (= .cse8 v_s_get_next_element_~iter.base_BEFORE_CALL_12) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2022-11-16 11:51:49,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:49,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:49,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:51:49,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:49,749 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 81 [2022-11-16 11:51:52,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,648 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-16 11:51:52,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 129 [2022-11-16 11:51:52,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:52,700 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-16 11:51:52,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 129 [2022-11-16 11:51:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 84 trivial. 35 not checked. [2022-11-16 11:51:56,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:17,463 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:52:30,295 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:52:49,078 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:52:58,594 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:53:09,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953365742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:09,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:53:09,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 40] total 68 [2022-11-16 11:53:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350486596] [2022-11-16 11:53:09,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:53:09,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-16 11:53:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-16 11:53:09,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=5372, Unknown=39, NotChecked=760, Total=6480 [2022-11-16 11:53:09,162 INFO L87 Difference]: Start difference. First operand 378 states and 501 transitions. Second operand has 68 states, 58 states have (on average 2.810344827586207) internal successors, (163), 51 states have internal predecessors, (163), 24 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (49), 19 states have call predecessors, (49), 21 states have call successors, (49) [2022-11-16 11:53:40,133 WARN L233 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:53:49,433 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:53:59,625 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:10,460 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:18,656 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:25,361 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:34,724 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:43,101 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:51,441 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:55:10,971 WARN L233 SmtUtils]: Spent 18.05s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:55:37,005 WARN L233 SmtUtils]: Spent 22.45s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:56:15,317 WARN L233 SmtUtils]: Spent 18.05s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:56:34,038 WARN L233 SmtUtils]: Spent 18.06s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:56:50,645 WARN L233 SmtUtils]: Spent 14.11s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:57:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:15,297 INFO L93 Difference]: Finished difference Result 799 states and 1065 transitions. [2022-11-16 11:57:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-16 11:57:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 58 states have (on average 2.810344827586207) internal successors, (163), 51 states have internal predecessors, (163), 24 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (49), 19 states have call predecessors, (49), 21 states have call successors, (49) Word has length 175 [2022-11-16 11:57:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:15,302 INFO L225 Difference]: With dead ends: 799 [2022-11-16 11:57:15,302 INFO L226 Difference]: Without dead ends: 546 [2022-11-16 11:57:15,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5263 ImplicationChecksByTransitivity, 555.8s TimeCoverageRelationStatistics Valid=1336, Invalid=19504, Unknown=60, NotChecked=1450, Total=22350 [2022-11-16 11:57:15,309 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 1319 mSDsluCounter, 4582 mSDsCounter, 0 mSdLazyCounter, 8772 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 4737 SdHoareTripleChecker+Invalid, 17471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 8772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7629 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:15,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 4737 Invalid, 17471 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1070 Valid, 8772 Invalid, 0 Unknown, 7629 Unchecked, 11.2s Time] [2022-11-16 11:57:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-16 11:57:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 506. [2022-11-16 11:57:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 348 states have (on average 1.235632183908046) internal successors, (430), 351 states have internal predecessors, (430), 105 states have call successors, (105), 48 states have call predecessors, (105), 52 states have return successors, (124), 106 states have call predecessors, (124), 104 states have call successors, (124) [2022-11-16 11:57:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 659 transitions. [2022-11-16 11:57:15,370 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 659 transitions. Word has length 175 [2022-11-16 11:57:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:15,371 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 659 transitions. [2022-11-16 11:57:15,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 58 states have (on average 2.810344827586207) internal successors, (163), 51 states have internal predecessors, (163), 24 states have call successors, (52), 16 states have call predecessors, (52), 15 states have return successors, (49), 19 states have call predecessors, (49), 21 states have call successors, (49) [2022-11-16 11:57:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 659 transitions. [2022-11-16 11:57:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-16 11:57:15,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:15,375 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:15,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:15,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:57:15,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1706553315, now seen corresponding path program 1 times [2022-11-16 11:57:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:15,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380340952] [2022-11-16 11:57:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:57:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:57:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:57:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:57:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:57:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:57:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:57:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:57:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:57:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:57:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:57:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:57:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:57:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:57:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:57:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:57:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:57:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:57:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:57:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:57:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-16 11:57:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 11:57:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:57:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-16 11:57:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:16,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380340952] [2022-11-16 11:57:16,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380340952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:16,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:16,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:57:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997670232] [2022-11-16 11:57:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:16,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:57:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:16,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:57:16,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:57:16,555 INFO L87 Difference]: Start difference. First operand 506 states and 659 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (25), 6 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-16 11:57:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:18,574 INFO L93 Difference]: Finished difference Result 808 states and 1090 transitions. [2022-11-16 11:57:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:57:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (25), 6 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2022-11-16 11:57:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:18,579 INFO L225 Difference]: With dead ends: 808 [2022-11-16 11:57:18,579 INFO L226 Difference]: Without dead ends: 500 [2022-11-16 11:57:18,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:57:18,581 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 322 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:18,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 832 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-16 11:57:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-11-16 11:57:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 488. [2022-11-16 11:57:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 334 states have (on average 1.218562874251497) internal successors, (407), 337 states have internal predecessors, (407), 103 states have call successors, (103), 46 states have call predecessors, (103), 50 states have return successors, (118), 104 states have call predecessors, (118), 102 states have call successors, (118) [2022-11-16 11:57:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 628 transitions. [2022-11-16 11:57:18,647 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 628 transitions. Word has length 175 [2022-11-16 11:57:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:18,648 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 628 transitions. [2022-11-16 11:57:18,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (25), 6 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-16 11:57:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 628 transitions. [2022-11-16 11:57:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-16 11:57:18,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:18,652 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:18,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:57:18,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:18,653 INFO L85 PathProgramCache]: Analyzing trace with hash 539676297, now seen corresponding path program 1 times [2022-11-16 11:57:18,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:18,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203651833] [2022-11-16 11:57:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:18,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:57:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:57:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:57:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 11:57:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:57:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:57:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:57:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:57:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:57:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:57:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:57:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:57:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:57:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:57:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:57:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:57:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:57:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:57:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:57:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:57:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 11:57:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 11:57:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:57:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:57:24,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:24,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203651833] [2022-11-16 11:57:24,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203651833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:24,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231491964] [2022-11-16 11:57:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:24,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:24,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:24,505 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:24,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:57:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:25,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:57:25,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-16 11:57:25,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:57:25,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231491964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:25,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:57:25,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2022-11-16 11:57:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559445639] [2022-11-16 11:57:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:25,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:57:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:57:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 11:57:25,424 INFO L87 Difference]: Start difference. First operand 488 states and 628 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-16 11:57:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:25,689 INFO L93 Difference]: Finished difference Result 926 states and 1198 transitions. [2022-11-16 11:57:25,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:57:25,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2022-11-16 11:57:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:25,694 INFO L225 Difference]: With dead ends: 926 [2022-11-16 11:57:25,694 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 11:57:25,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1103, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:57:25,700 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 2 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:25,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1724 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:57:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 11:57:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 483. [2022-11-16 11:57:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 330 states have (on average 1.215151515151515) internal successors, (401), 333 states have internal predecessors, (401), 103 states have call successors, (103), 46 states have call predecessors, (103), 49 states have return successors, (117), 103 states have call predecessors, (117), 102 states have call successors, (117) [2022-11-16 11:57:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 621 transitions. [2022-11-16 11:57:25,753 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 621 transitions. Word has length 176 [2022-11-16 11:57:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:25,754 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 621 transitions. [2022-11-16 11:57:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-16 11:57:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 621 transitions. [2022-11-16 11:57:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-16 11:57:25,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:25,757 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:25,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:25,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:57:25,968 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:57:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 400215387, now seen corresponding path program 1 times [2022-11-16 11:57:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:25,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328471461] [2022-11-16 11:57:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:26,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:57:26,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979961360] [2022-11-16 11:57:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:26,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:26,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:26,045 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:26,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:57:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:26,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-16 11:57:26,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:27,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:27,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 11:57:27,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:27,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 11:57:28,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,166 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-16 11:57:28,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 78 [2022-11-16 11:57:28,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:28,184 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:57:28,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 78 [2022-11-16 11:57:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 107 proven. 5 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-16 11:57:29,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:57:39,988 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:57:50,200 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:00,350 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:10,475 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:10,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:10,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328471461] [2022-11-16 11:58:10,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:58:10,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979961360] [2022-11-16 11:58:10,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979961360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:10,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:58:10,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-11-16 11:58:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145771537] [2022-11-16 11:58:10,800 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:10,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:58:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:58:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 11:58:10,802 INFO L87 Difference]: Start difference. First operand 483 states and 621 transitions. Second operand has 25 states, 21 states have (on average 4.476190476190476) internal successors, (94), 24 states have internal predecessors, (94), 12 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-11-16 11:58:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:12,422 INFO L93 Difference]: Finished difference Result 737 states and 974 transitions. [2022-11-16 11:58:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:58:12,425 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.476190476190476) internal successors, (94), 24 states have internal predecessors, (94), 12 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 182 [2022-11-16 11:58:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:12,428 INFO L225 Difference]: With dead ends: 737 [2022-11-16 11:58:12,428 INFO L226 Difference]: Without dead ends: 492 [2022-11-16 11:58:12,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=196, Invalid=1696, Unknown=0, NotChecked=0, Total=1892 [2022-11-16 11:58:12,430 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 488 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 3776 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 724 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:12,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 3776 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 340 Invalid, 0 Unknown, 724 Unchecked, 0.9s Time] [2022-11-16 11:58:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-16 11:58:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2022-11-16 11:58:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 335 states have (on average 1.2119402985074628) internal successors, (406), 336 states have internal predecessors, (406), 103 states have call successors, (103), 47 states have call predecessors, (103), 49 states have return successors, (117), 104 states have call predecessors, (117), 102 states have call successors, (117) [2022-11-16 11:58:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 626 transitions. [2022-11-16 11:58:12,486 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 626 transitions. Word has length 182 [2022-11-16 11:58:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:12,486 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 626 transitions. [2022-11-16 11:58:12,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.476190476190476) internal successors, (94), 24 states have internal predecessors, (94), 12 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-11-16 11:58:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 626 transitions. [2022-11-16 11:58:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-16 11:58:12,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:12,490 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:12,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-16 11:58:12,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:58:12,701 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:58:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -510431116, now seen corresponding path program 1 times [2022-11-16 11:58:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122219635] [2022-11-16 11:58:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:12,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:58:12,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096337276] [2022-11-16 11:58:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:12,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:12,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:58:12,769 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:58:12,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:58:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:13,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 11:58:13,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:13,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:13,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 11:58:13,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:13,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 11:58:14,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:58:14,871 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:58:14,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 78 [2022-11-16 11:58:14,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:14,912 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-16 11:58:14,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 78 [2022-11-16 11:58:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 109 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-16 11:58:16,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:58:26,578 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:36,756 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:46,931 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:57,052 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:58:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122219635] [2022-11-16 11:58:57,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:58:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096337276] [2022-11-16 11:58:57,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096337276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:57,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:58:57,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-11-16 11:58:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856455127] [2022-11-16 11:58:57,391 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:57,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 11:58:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 11:58:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 11:58:57,393 INFO L87 Difference]: Start difference. First operand 488 states and 626 transitions. Second operand has 24 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 12 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-11-16 11:58:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:58,822 INFO L93 Difference]: Finished difference Result 773 states and 1028 transitions. [2022-11-16 11:58:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:58:58,823 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 12 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 182 [2022-11-16 11:58:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:58,826 INFO L225 Difference]: With dead ends: 773 [2022-11-16 11:58:58,827 INFO L226 Difference]: Without dead ends: 507 [2022-11-16 11:58:58,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 169 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 11:58:58,829 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 508 mSDsluCounter, 4237 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4604 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 789 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:58,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4604 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 425 Invalid, 0 Unknown, 789 Unchecked, 1.1s Time] [2022-11-16 11:58:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-16 11:58:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2022-11-16 11:58:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 350 states have (on average 1.2028571428571428) internal successors, (421), 351 states have internal predecessors, (421), 103 states have call successors, (103), 47 states have call predecessors, (103), 49 states have return successors, (117), 104 states have call predecessors, (117), 102 states have call successors, (117) [2022-11-16 11:58:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 641 transitions. [2022-11-16 11:58:58,895 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 641 transitions. Word has length 182 [2022-11-16 11:58:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:58,896 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 641 transitions. [2022-11-16 11:58:58,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 12 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-11-16 11:58:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 641 transitions. [2022-11-16 11:58:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-11-16 11:58:58,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:58,899 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:58,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:58:59,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:58:59,113 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:58:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1048548953, now seen corresponding path program 1 times [2022-11-16 11:58:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:59,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453310679] [2022-11-16 11:58:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:59,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:58:59,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272539894] [2022-11-16 11:58:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:58:59,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:58:59,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:59:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:00,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 220 conjunts are in the unsatisfiable core [2022-11-16 11:59:00,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:01,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-16 11:59:01,126 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 11 treesize of output 7 [2022-11-16 11:59:01,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:01,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 39 [2022-11-16 11:59:01,150 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 11 treesize of output 7 [2022-11-16 11:59:02,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:02,045 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:59:02,046 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 107 treesize of output 96 [2022-11-16 11:59:02,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:02,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:02,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:02,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2022-11-16 11:59:02,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:02,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 20 [2022-11-16 11:59:03,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:59:03,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:03,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:03,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 35 [2022-11-16 11:59:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:03,283 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 11:59:03,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 78 treesize of output 69 [2022-11-16 11:59:03,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2022-11-16 11:59:05,077 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-16 11:59:05,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 95 [2022-11-16 11:59:10,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:10,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:59:10,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2022-11-16 11:59:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 106 proven. 92 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 11:59:10,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:59:11,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4315 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_hash_iter_begin_~#iter~1#1.base| v_ArrVal_4315) |c_ULTIMATE.start_aws_hash_iter_begin_~state~11#1.base|) (+ 40 |c_ULTIMATE.start_aws_hash_iter_begin_~state~11#1.offset|)) 18446744073709551616))) is different from false [2022-11-16 11:59:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453310679] [2022-11-16 11:59:11,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:59:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272539894] [2022-11-16 11:59:11,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272539894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:59:11,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:59:11,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-11-16 11:59:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912815747] [2022-11-16 11:59:11,166 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:11,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 11:59:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:11,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 11:59:11,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=903, Unknown=2, NotChecked=60, Total=1056 [2022-11-16 11:59:11,170 INFO L87 Difference]: Start difference. First operand 503 states and 641 transitions. Second operand has 28 states, 23 states have (on average 4.695652173913044) internal successors, (108), 24 states have internal predecessors, (108), 16 states have call successors, (30), 7 states have call predecessors, (30), 10 states have return successors, (28), 14 states have call predecessors, (28), 15 states have call successors, (28) [2022-11-16 11:59:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:40,300 INFO L93 Difference]: Finished difference Result 806 states and 1035 transitions. [2022-11-16 11:59:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 11:59:40,301 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 4.695652173913044) internal successors, (108), 24 states have internal predecessors, (108), 16 states have call successors, (30), 7 states have call predecessors, (30), 10 states have return successors, (28), 14 states have call predecessors, (28), 15 states have call successors, (28) Word has length 192 [2022-11-16 11:59:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:40,304 INFO L225 Difference]: With dead ends: 806 [2022-11-16 11:59:40,305 INFO L226 Difference]: Without dead ends: 518 [2022-11-16 11:59:40,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 220 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=196, Invalid=2347, Unknown=11, NotChecked=98, Total=2652 [2022-11-16 11:59:40,307 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 144 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 3991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 893 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:40,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 3597 Invalid, 3991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3029 Invalid, 0 Unknown, 893 Unchecked, 3.8s Time] [2022-11-16 11:59:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-11-16 11:59:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 493. [2022-11-16 11:59:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 337 states have (on average 1.1839762611275964) internal successors, (399), 339 states have internal predecessors, (399), 103 states have call successors, (103), 49 states have call predecessors, (103), 52 states have return successors, (116), 104 states have call predecessors, (116), 102 states have call successors, (116) [2022-11-16 11:59:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2022-11-16 11:59:40,369 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 192 [2022-11-16 11:59:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:40,370 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2022-11-16 11:59:40,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 4.695652173913044) internal successors, (108), 24 states have internal predecessors, (108), 16 states have call successors, (30), 7 states have call predecessors, (30), 10 states have return successors, (28), 14 states have call predecessors, (28), 15 states have call successors, (28) [2022-11-16 11:59:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2022-11-16 11:59:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-11-16 11:59:40,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:40,372 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:40,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:40,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:59:40,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1136387251, now seen corresponding path program 1 times [2022-11-16 11:59:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:40,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995194465] [2022-11-16 11:59:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:40,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:59:40,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579517040] [2022-11-16 11:59:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:40,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:59:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:59:40,646 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:59:40,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:59:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:44,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 2817 conjuncts, 371 conjunts are in the unsatisfiable core [2022-11-16 11:59:44,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:44,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:59:44,404 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:59:44,405 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:59:44,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:59:45,048 INFO L321 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2022-11-16 11:59:45,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 186 [2022-11-16 11:59:45,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:59:45,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:45,561 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:59:45,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 11:59:45,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 11:59:45,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:59:45,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:59:45,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:59:45,689 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 11 treesize of output 7 [2022-11-16 11:59:48,240 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:59:48,240 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:59:48,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:48,269 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:59:48,269 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 101 treesize of output 92 [2022-11-16 11:59:48,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:48,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2022-11-16 11:59:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:48,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 37 [2022-11-16 11:59:50,193 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:59:50,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-16 11:59:50,472 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4668 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4668) |c_#memory_int|)) (exists ((v_ArrVal_4667 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4667) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4666 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4666) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:59:50,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 38 [2022-11-16 11:59:50,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 47 [2022-11-16 11:59:50,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:50,532 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:59:50,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:50,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:50,648 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 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-16 11:59:50,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:50,659 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 0 case distinctions, treesize of input 78 treesize of output 69 [2022-11-16 11:59:50,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:50,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:50,679 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 0 case distinctions, treesize of input 87 treesize of output 74 [2022-11-16 11:59:50,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 21 [2022-11-16 11:59:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 113 proven. 111 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2022-11-16 11:59:54,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:59:55,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:55,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995194465] [2022-11-16 11:59:55,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:59:55,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579517040] [2022-11-16 11:59:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579517040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:59:55,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:59:55,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2022-11-16 11:59:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165238556] [2022-11-16 11:59:55,205 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:55,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:59:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:59:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2658, Unknown=19, NotChecked=104, Total=2970 [2022-11-16 11:59:55,207 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 50 states, 41 states have (on average 3.048780487804878) internal successors, (125), 42 states have internal predecessors, (125), 20 states have call successors, (32), 10 states have call predecessors, (32), 14 states have return successors, (30), 18 states have call predecessors, (30), 19 states have call successors, (30) [2022-11-16 12:00:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:03,904 INFO L93 Difference]: Finished difference Result 963 states and 1208 transitions. [2022-11-16 12:00:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-16 12:00:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 41 states have (on average 3.048780487804878) internal successors, (125), 42 states have internal predecessors, (125), 20 states have call successors, (32), 10 states have call predecessors, (32), 14 states have return successors, (30), 18 states have call predecessors, (30), 19 states have call successors, (30) Word has length 193 [2022-11-16 12:00:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:03,909 INFO L225 Difference]: With dead ends: 963 [2022-11-16 12:00:03,909 INFO L226 Difference]: Without dead ends: 678 [2022-11-16 12:00:03,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 192 SyntacticMatches, 19 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2372 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=409, Invalid=6700, Unknown=35, NotChecked=166, Total=7310 [2022-11-16 12:00:03,913 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 265 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 3803 SdHoareTripleChecker+Invalid, 8740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5960 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:03,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 3803 Invalid, 8740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2536 Invalid, 0 Unknown, 5960 Unchecked, 4.7s Time] [2022-11-16 12:00:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-16 12:00:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 620. [2022-11-16 12:00:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 424 states have (on average 1.153301886792453) internal successors, (489), 429 states have internal predecessors, (489), 123 states have call successors, (123), 65 states have call predecessors, (123), 72 states have return successors, (144), 125 states have call predecessors, (144), 122 states have call successors, (144) [2022-11-16 12:00:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 756 transitions. [2022-11-16 12:00:04,019 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 756 transitions. Word has length 193 [2022-11-16 12:00:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:04,019 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 756 transitions. [2022-11-16 12:00:04,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 41 states have (on average 3.048780487804878) internal successors, (125), 42 states have internal predecessors, (125), 20 states have call successors, (32), 10 states have call predecessors, (32), 14 states have return successors, (30), 18 states have call predecessors, (30), 19 states have call successors, (30) [2022-11-16 12:00:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 756 transitions. [2022-11-16 12:00:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-16 12:00:04,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:04,022 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:04,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:04,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:00:04,239 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -118160158, now seen corresponding path program 1 times [2022-11-16 12:00:04,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:04,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714175053] [2022-11-16 12:00:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:04,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:00:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:00:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:00:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:00:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:00:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:00:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:00:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:00:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:00:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:00:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:00:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:00:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:00:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:00:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:00:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 12:00:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:00:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:00:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:00:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 12:00:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:00:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:00:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-16 12:00:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-16 12:00:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:00:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 12:00:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-11-16 12:00:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:05,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714175053] [2022-11-16 12:00:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714175053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:05,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:00:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752859951] [2022-11-16 12:00:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:05,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:00:05,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:05,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:00:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:00:05,207 INFO L87 Difference]: Start difference. First operand 620 states and 756 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-16 12:00:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:07,474 INFO L93 Difference]: Finished difference Result 1088 states and 1345 transitions. [2022-11-16 12:00:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:00:07,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) Word has length 199 [2022-11-16 12:00:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:07,484 INFO L225 Difference]: With dead ends: 1088 [2022-11-16 12:00:07,484 INFO L226 Difference]: Without dead ends: 612 [2022-11-16 12:00:07,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:00:07,486 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 405 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:07,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1061 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-16 12:00:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-11-16 12:00:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2022-11-16 12:00:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 419 states have (on average 1.152744630071599) internal successors, (483), 423 states have internal predecessors, (483), 121 states have call successors, (121), 65 states have call predecessors, (121), 71 states have return successors, (140), 123 states have call predecessors, (140), 120 states have call successors, (140) [2022-11-16 12:00:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 744 transitions. [2022-11-16 12:00:07,569 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 744 transitions. Word has length 199 [2022-11-16 12:00:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:07,569 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 744 transitions. [2022-11-16 12:00:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (27), 6 states have call predecessors, (27), 4 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-16 12:00:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 744 transitions. [2022-11-16 12:00:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-11-16 12:00:07,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:07,572 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:07,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:00:07,572 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 207114854, now seen corresponding path program 1 times [2022-11-16 12:00:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:07,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210443095] [2022-11-16 12:00:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:07,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:00:07,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131961496] [2022-11-16 12:00:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:07,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:00:07,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:00:07,652 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:00:07,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2d57608-ef7e-43c8-86e6-6fc070074886/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:00:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:14,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 2828 conjuncts, 370 conjunts are in the unsatisfiable core [2022-11-16 12:00:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:14,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:15,001 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:00:15,002 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:00:15,071 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 5 treesize of output 3 [2022-11-16 12:00:15,666 INFO L321 Elim1Store]: treesize reduction 119, result has 24.2 percent of original size [2022-11-16 12:00:15,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 88 treesize of output 107 [2022-11-16 12:00:16,015 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 5 treesize of output 3 [2022-11-16 12:00:16,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:16,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:00:16,229 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 11 treesize of output 7 [2022-11-16 12:00:16,236 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 12 treesize of output 14 [2022-11-16 12:00:16,252 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-16 12:00:16,261 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 11 treesize of output 7 [2022-11-16 12:00:16,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:16,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 39 [2022-11-16 12:00:19,535 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:00:19,536 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:00:19,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:19,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:00:19,563 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 103 treesize of output 94 [2022-11-16 12:00:19,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:19,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:19,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2022-11-16 12:00:19,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:19,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 37 [2022-11-16 12:00:21,892 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:00:21,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-16 12:00:22,262 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5232 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5232) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5231 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5231) |c_#memory_int|)) (exists ((v_ArrVal_5233 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5233)))) is different from true [2022-11-16 12:00:22,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 38 [2022-11-16 12:00:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:22,313 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 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 12:00:22,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 47 [2022-11-16 12:00:22,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:22,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:22,489 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 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-16 12:00:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:22,499 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 0 case distinctions, treesize of input 78 treesize of output 69 [2022-11-16 12:00:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:22,522 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 0 case distinctions, treesize of input 87 treesize of output 74 [2022-11-16 12:00:22,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 31 [2022-11-16 12:00:26,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:26,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 58 [2022-11-16 12:00:26,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:26,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:00:26,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 12 [2022-11-16 12:00:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 101 proven. 116 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2022-11-16 12:00:26,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:28,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210443095] [2022-11-16 12:00:28,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:00:28,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131961496] [2022-11-16 12:00:28,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131961496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:28,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:00:28,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2022-11-16 12:00:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688461931] [2022-11-16 12:00:28,008 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:28,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 12:00:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 12:00:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3541, Unknown=23, NotChecked=120, Total=3906 [2022-11-16 12:00:28,011 INFO L87 Difference]: Start difference. First operand 612 states and 744 transitions. Second operand has 57 states, 46 states have (on average 2.717391304347826) internal successors, (125), 48 states have internal predecessors, (125), 21 states have call successors, (32), 9 states have call predecessors, (32), 16 states have return successors, (30), 21 states have call predecessors, (30), 20 states have call successors, (30)