./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 13ab51b5126028da19fd5973a25f590452a4763e1cc4e396aeee438668151298 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:04:45,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:04:45,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:04:45,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:04:45,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:04:45,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:04:45,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:04:45,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:04:45,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:04:45,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:04:45,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:04:45,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:04:45,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:04:45,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:04:45,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:04:45,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:04:45,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:04:45,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:04:45,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:04:45,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:04:45,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:04:45,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:04:45,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:04:45,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:04:45,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:04:45,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:04:45,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:04:45,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:04:45,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:04:45,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:04:45,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:04:45,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:04:45,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:04:45,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:04:45,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:04:45,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:04:45,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:04:45,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:04:45,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:04:45,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:04:45,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:04:45,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:04:45,150 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:04:45,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:04:45,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:04:45,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:04:45,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:04:45,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:04:45,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:04:45,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:04:45,152 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:04:45,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:04:45,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:04:45,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:04:45,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:04:45,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:04:45,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:04:45,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:04:45,154 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:04:45,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:04:45,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:04:45,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:04:45,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:04:45,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:04:45,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:04:45,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:04:45,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:04:45,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:04:45,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:04:45,156 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:04:45,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:04:45,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:04:45,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:04:45,156 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 13ab51b5126028da19fd5973a25f590452a4763e1cc4e396aeee438668151298 [2021-11-16 21:04:45,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:04:45,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:04:45,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:04:45,420 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:04:45,420 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:04:45,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i [2021-11-16 21:04:45,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910cbb1e7/c8d451dc3dea401fb428762be9b9f96c/FLAG7229e65ca [2021-11-16 21:04:46,168 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:04:46,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i [2021-11-16 21:04:46,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910cbb1e7/c8d451dc3dea401fb428762be9b9f96c/FLAG7229e65ca [2021-11-16 21:04:46,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910cbb1e7/c8d451dc3dea401fb428762be9b9f96c [2021-11-16 21:04:46,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:04:46,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:04:46,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:04:46,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:04:46,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:04:46,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:04:46" (1/1) ... [2021-11-16 21:04:46,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725373df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:46, skipping insertion in model container [2021-11-16 21:04:46,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:04:46" (1/1) ... [2021-11-16 21:04:46,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:04:46,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:04:46,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i[4492,4505] [2021-11-16 21:04:46,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i[4552,4565] [2021-11-16 21:04:46,702 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:04:46,709 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:04:47,687 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,687 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,689 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,689 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,690 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,702 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,703 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,705 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,705 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,707 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,709 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,709 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:47,710 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,003 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:04:48,004 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:04:48,005 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:04:48,005 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:04:48,010 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:04:48,011 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:04:48,011 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:04:48,012 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:04:48,012 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:04:48,012 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:04:48,128 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:04:48,370 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,370 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,392 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,393 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,398 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,398 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,414 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,415 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,415 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,415 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,416 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,416 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,416 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,448 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:04:48,479 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:04:48,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i[4492,4505] [2021-11-16 21:04:48,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_next_harness.i[4552,4565] [2021-11-16 21:04:48,503 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:04:48,504 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:04:48,534 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,535 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,535 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,535 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,536 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,541 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,542 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,543 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,543 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,544 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,544 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,545 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,545 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:04:48,593 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:04:48,594 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:04:48,594 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:04:48,595 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:04:48,597 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:04:48,597 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:04:48,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:04:48,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:04:48,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:04:48,617 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:04:48,675 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,680 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,681 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,682 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,682 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,689 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,690 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,690 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,690 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,691 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,691 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,691 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:04:48,703 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:04:48,862 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:04:48,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48 WrapperNode [2021-11-16 21:04:48,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:04:48,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:04:48,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:04:48,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:04:48,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:48,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,029 INFO L137 Inliner]: procedures = 776, calls = 2454, calls flagged for inlining = 67, calls inlined = 11, statements flattened = 638 [2021-11-16 21:04:49,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:04:49,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:04:49,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:04:49,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:04:49,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:04:49,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:04:49,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:04:49,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:04:49,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (1/1) ... [2021-11-16 21:04:49,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:04:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:49,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 21:04:49,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 21:04:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-16 21:04:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:04:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:04:49,177 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:04:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:04:49,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:04:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2021-11-16 21:04:49,178 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2021-11-16 21:04:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:04:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:04:49,178 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_next [2021-11-16 21:04:49,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_next [2021-11-16 21:04:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:04:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:04:49,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:04:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:04:49,179 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:04:49,179 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:04:49,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:04:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-16 21:04:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:04:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2021-11-16 21:04:49,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2021-11-16 21:04:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:04:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:04:49,180 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 21:04:49,180 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 21:04:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 21:04:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2021-11-16 21:04:49,181 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2021-11-16 21:04:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:04:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2021-11-16 21:04:49,181 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2021-11-16 21:04:49,181 INFO L130 BoogieDeclarations]: Found specification of procedure s_get_next_element [2021-11-16 21:04:49,182 INFO L138 BoogieDeclarations]: Found implementation of procedure s_get_next_element [2021-11-16 21:04:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:04:49,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:04:49,182 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2021-11-16 21:04:49,183 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2021-11-16 21:04:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2021-11-16 21:04:49,184 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2021-11-16 21:04:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:04:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:04:49,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:04:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2021-11-16 21:04:49,185 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2021-11-16 21:04:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:04:49,481 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:04:49,482 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:04:52,154 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:04:52,161 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:04:52,161 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-16 21:04:52,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:04:52 BoogieIcfgContainer [2021-11-16 21:04:52,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:04:52,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:04:52,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:04:52,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:04:52,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:04:46" (1/3) ... [2021-11-16 21:04:52,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c98d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:04:52, skipping insertion in model container [2021-11-16 21:04:52,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:04:48" (2/3) ... [2021-11-16 21:04:52,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c98d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:04:52, skipping insertion in model container [2021-11-16 21:04:52,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:04:52" (3/3) ... [2021-11-16 21:04:52,169 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_next_harness.i [2021-11-16 21:04:52,172 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:04:52,173 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 21:04:52,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:04:52,249 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:04:52,250 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 21:04:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 107 states have internal predecessors, (132), 43 states have call successors, (43), 16 states have call predecessors, (43), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-11-16 21:04:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-16 21:04:52,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:52,280 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:04:52,280 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1338571704, now seen corresponding path program 1 times [2021-11-16 21:04:52,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:52,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085535829] [2021-11-16 21:04:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:52,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:04:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:52,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:04:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:52,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:04:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:04:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:04:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:04:52,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:04:52,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085535829] [2021-11-16 21:04:52,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-11-16 21:04:52,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636967221] [2021-11-16 21:04:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:52,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:52,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:52,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:04:52,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 21:04:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:53,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 21:04:53,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:04:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2021-11-16 21:04:53,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:04:53,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636967221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:04:53,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:04:53,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-16 21:04:53,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225129414] [2021-11-16 21:04:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:04:53,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:04:53,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:04:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:04:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:04:53,501 INFO L87 Difference]: Start difference. First operand has 167 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 107 states have internal predecessors, (132), 43 states have call successors, (43), 16 states have call predecessors, (43), 16 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-16 21:04:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:04:53,561 INFO L93 Difference]: Finished difference Result 326 states and 449 transitions. [2021-11-16 21:04:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:04:53,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2021-11-16 21:04:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:04:53,578 INFO L225 Difference]: With dead ends: 326 [2021-11-16 21:04:53,579 INFO L226 Difference]: Without dead ends: 161 [2021-11-16 21:04:53,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 21:04:53,584 INFO L933 BasicCegarLoop]: 215 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, 215 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 [2021-11-16 21:04:53,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:04:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-16 21:04:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-11-16 21:04:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 102 states have internal predecessors, (124), 43 states have call successors, (43), 16 states have call predecessors, (43), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2021-11-16 21:04:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 209 transitions. [2021-11-16 21:04:53,620 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 209 transitions. Word has length 154 [2021-11-16 21:04:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:04:53,620 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 209 transitions. [2021-11-16 21:04:53,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-16 21:04:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2021-11-16 21:04:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-16 21:04:53,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:53,625 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:04:53,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:04:53,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-11-16 21:04:53,840 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 539862202, now seen corresponding path program 1 times [2021-11-16 21:04:53,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:53,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591069478] [2021-11-16 21:04:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:53,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:04:53,906 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:04:53,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282275591] [2021-11-16 21:04:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:53,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:53,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:04:53,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 21:04:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:54,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 21:04:54,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:04:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 21:04:54,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:04:54,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:04:54,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591069478] [2021-11-16 21:04:54,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:04:54,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282275591] [2021-11-16 21:04:54,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282275591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:04:54,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:04:54,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:04:54,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842520554] [2021-11-16 21:04:54,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:04:54,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:04:54,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:04:54,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:04:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:04:54,638 INFO L87 Difference]: Start difference. First operand 161 states and 209 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-16 21:04:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:04:54,797 INFO L93 Difference]: Finished difference Result 297 states and 388 transitions. [2021-11-16 21:04:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:04:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 154 [2021-11-16 21:04:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:04:54,800 INFO L225 Difference]: With dead ends: 297 [2021-11-16 21:04:54,800 INFO L226 Difference]: Without dead ends: 163 [2021-11-16 21:04:54,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:04:54,807 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 173 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:04:54,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 651 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:04:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-16 21:04:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-11-16 21:04:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 104 states have internal predecessors, (125), 43 states have call successors, (43), 16 states have call predecessors, (43), 17 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2021-11-16 21:04:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2021-11-16 21:04:54,819 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 154 [2021-11-16 21:04:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:04:54,820 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2021-11-16 21:04:54,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-16 21:04:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2021-11-16 21:04:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-16 21:04:54,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:54,823 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:04:54,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 21:04:55,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-11-16 21:04:55,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 706357182, now seen corresponding path program 1 times [2021-11-16 21:04:55,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:55,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273149540] [2021-11-16 21:04:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:55,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:04:55,081 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:04:55,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889359665] [2021-11-16 21:04:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:55,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:55,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:55,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:04:55,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 21:04:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:55,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 2430 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:04:55,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:04:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 102 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-16 21:04:55,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:04:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-16 21:04:56,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:04:56,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273149540] [2021-11-16 21:04:56,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:04:56,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889359665] [2021-11-16 21:04:56,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889359665] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:04:56,091 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:04:56,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-11-16 21:04:56,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61346969] [2021-11-16 21:04:56,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:04:56,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 21:04:56,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:04:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 21:04:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:04:56,093 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 13 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 8 states have call successors, (48), 5 states have call predecessors, (48), 4 states have return successors, (44), 6 states have call predecessors, (44), 8 states have call successors, (44) [2021-11-16 21:04:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:04:56,365 INFO L93 Difference]: Finished difference Result 249 states and 329 transitions. [2021-11-16 21:04:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:04:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 8 states have call successors, (48), 5 states have call predecessors, (48), 4 states have return successors, (44), 6 states have call predecessors, (44), 8 states have call successors, (44) Word has length 155 [2021-11-16 21:04:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:04:56,374 INFO L225 Difference]: With dead ends: 249 [2021-11-16 21:04:56,374 INFO L226 Difference]: Without dead ends: 163 [2021-11-16 21:04:56,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:04:56,379 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 216 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:04:56,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 1235 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:04:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-16 21:04:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-11-16 21:04:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 104 states have internal predecessors, (125), 43 states have call successors, (43), 16 states have call predecessors, (43), 17 states have return successors, (43), 42 states have call predecessors, (43), 42 states have call successors, (43) [2021-11-16 21:04:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2021-11-16 21:04:56,391 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 155 [2021-11-16 21:04:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:04:56,392 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2021-11-16 21:04:56,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 8 states have call successors, (48), 5 states have call predecessors, (48), 4 states have return successors, (44), 6 states have call predecessors, (44), 8 states have call successors, (44) [2021-11-16 21:04:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2021-11-16 21:04:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 21:04:56,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:56,395 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:04:56,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:04:56,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:56,609 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:56,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1731864020, now seen corresponding path program 2 times [2021-11-16 21:04:56,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:56,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095892292] [2021-11-16 21:04:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:56,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:04:56,640 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:04:56,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653470173] [2021-11-16 21:04:56,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:04:56,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:56,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:56,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:04:56,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 21:04:57,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:04:57,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:04:57,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 2435 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:04:57,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:04:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 6 proven. 122 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-11-16 21:04:58,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:04:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-16 21:04:58,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:04:58,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095892292] [2021-11-16 21:04:58,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:04:58,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653470173] [2021-11-16 21:04:58,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653470173] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:04:58,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:04:58,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 17 [2021-11-16 21:04:58,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394224703] [2021-11-16 21:04:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:04:58,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:04:58,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:04:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:04:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:04:58,470 INFO L87 Difference]: Start difference. First operand 163 states and 211 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 6 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-16 21:04:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:04:58,822 INFO L93 Difference]: Finished difference Result 231 states and 301 transitions. [2021-11-16 21:04:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:04:58,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 6 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) Word has length 156 [2021-11-16 21:04:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:04:58,825 INFO L225 Difference]: With dead ends: 231 [2021-11-16 21:04:58,825 INFO L226 Difference]: Without dead ends: 161 [2021-11-16 21:04:58,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-11-16 21:04:58,826 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 226 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:04:58,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 1044 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:04:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-16 21:04:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-11-16 21:04:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 102 states have internal predecessors, (123), 43 states have call successors, (43), 16 states have call predecessors, (43), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2021-11-16 21:04:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 208 transitions. [2021-11-16 21:04:58,849 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 208 transitions. Word has length 156 [2021-11-16 21:04:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:04:58,850 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 208 transitions. [2021-11-16 21:04:58,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 6 states have call successors, (25), 4 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-16 21:04:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 208 transitions. [2021-11-16 21:04:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-16 21:04:58,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:58,856 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:04:58,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:04:59,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:59,079 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2064715578, now seen corresponding path program 1 times [2021-11-16 21:04:59,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:59,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529791976] [2021-11-16 21:04:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:59,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:04:59,120 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:04:59,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627615165] [2021-11-16 21:04:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:59,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:59,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:59,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:04:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 21:04:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:59,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 2432 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:04:59,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:04:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-11-16 21:04:59,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:04:59,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:04:59,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529791976] [2021-11-16 21:04:59,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:04:59,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627615165] [2021-11-16 21:04:59,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627615165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:04:59,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:04:59,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:04:59,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030793677] [2021-11-16 21:04:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:04:59,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:04:59,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:04:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:04:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:04:59,678 INFO L87 Difference]: Start difference. First operand 161 states and 208 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-16 21:04:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:04:59,698 INFO L93 Difference]: Finished difference Result 315 states and 408 transitions. [2021-11-16 21:04:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:04:59,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2021-11-16 21:04:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:04:59,699 INFO L225 Difference]: With dead ends: 315 [2021-11-16 21:04:59,699 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 21:04:59,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:04:59,700 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:04:59,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 816 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:04:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 21:04:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 21:04:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 106 states have internal predecessors, (127), 43 states have call successors, (43), 16 states have call predecessors, (43), 17 states have return successors, (43), 43 states have call predecessors, (43), 42 states have call successors, (43) [2021-11-16 21:04:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 213 transitions. [2021-11-16 21:04:59,716 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 213 transitions. Word has length 155 [2021-11-16 21:04:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:04:59,718 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 213 transitions. [2021-11-16 21:04:59,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2021-11-16 21:04:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 213 transitions. [2021-11-16 21:04:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-16 21:04:59,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:59,720 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:04:59,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:04:59,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:59,935 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:59,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1425847546, now seen corresponding path program 1 times [2021-11-16 21:04:59,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:59,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332176271] [2021-11-16 21:04:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:59,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:05:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:05:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 21:05:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 21:05:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:05:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 21:05:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:05:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-16 21:05:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-16 21:05:00,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:00,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332176271] [2021-11-16 21:05:00,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332176271] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:00,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269039451] [2021-11-16 21:05:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:00,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:00,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:00,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 21:05:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:00,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-16 21:05:00,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:01,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-16 21:05:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-11-16 21:05:01,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:01,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269039451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:01,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:01,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2021-11-16 21:05:01,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643575301] [2021-11-16 21:05:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:01,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:05:01,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:01,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:05:01,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-11-16 21:05:01,358 INFO L87 Difference]: Start difference. First operand 166 states and 213 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 9 states have internal predecessors, (85), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-16 21:05:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:01,548 INFO L93 Difference]: Finished difference Result 320 states and 410 transitions. [2021-11-16 21:05:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:05:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 9 states have internal predecessors, (85), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 167 [2021-11-16 21:05:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:01,550 INFO L225 Difference]: With dead ends: 320 [2021-11-16 21:05:01,550 INFO L226 Difference]: Without dead ends: 175 [2021-11-16 21:05:01,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-11-16 21:05:01,551 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 12 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:01,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 1507 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2021-11-16 21:05:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-16 21:05:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-16 21:05:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 114 states have internal predecessors, (137), 43 states have call successors, (43), 17 states have call predecessors, (43), 18 states have return successors, (44), 43 states have call predecessors, (44), 42 states have call successors, (44) [2021-11-16 21:05:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions. [2021-11-16 21:05:01,559 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 167 [2021-11-16 21:05:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:01,560 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 224 transitions. [2021-11-16 21:05:01,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 9 states have internal predecessors, (85), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2021-11-16 21:05:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions. [2021-11-16 21:05:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-16 21:05:01,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:01,561 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:01,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:01,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:01,775 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -440861128, now seen corresponding path program 1 times [2021-11-16 21:05:01,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:01,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046582714] [2021-11-16 21:05:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:01,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 21:05:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:05:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 21:05:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 21:05:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:05:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 21:05:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:05:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-16 21:05:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-16 21:05:02,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:02,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046582714] [2021-11-16 21:05:02,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046582714] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:02,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581891235] [2021-11-16 21:05:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:02,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:02,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:02,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 21:05:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:02,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:05:02,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-11-16 21:05:02,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:02,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581891235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:02,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:02,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2021-11-16 21:05:02,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854245841] [2021-11-16 21:05:02,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:02,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:05:02,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:02,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:05:02,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:05:02,786 INFO L87 Difference]: Start difference. First operand 175 states and 224 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-16 21:05:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:02,909 INFO L93 Difference]: Finished difference Result 324 states and 418 transitions. [2021-11-16 21:05:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:05:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 167 [2021-11-16 21:05:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:02,910 INFO L225 Difference]: With dead ends: 324 [2021-11-16 21:05:02,910 INFO L226 Difference]: Without dead ends: 177 [2021-11-16 21:05:02,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:05:02,911 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 215 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:02,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 510 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:05:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-16 21:05:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-16 21:05:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 115 states have internal predecessors, (137), 44 states have call successors, (44), 17 states have call predecessors, (44), 18 states have return successors, (46), 44 states have call predecessors, (46), 43 states have call successors, (46) [2021-11-16 21:05:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 227 transitions. [2021-11-16 21:05:02,919 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 227 transitions. Word has length 167 [2021-11-16 21:05:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:02,919 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 227 transitions. [2021-11-16 21:05:02,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-16 21:05:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 227 transitions. [2021-11-16 21:05:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-16 21:05:02,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:02,921 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:02,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:03,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:03,121 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash -529280984, now seen corresponding path program 1 times [2021-11-16 21:05:03,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:03,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100548159] [2021-11-16 21:05:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:03,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:05:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 21:05:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 21:05:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 21:05:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:05:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:05:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-16 21:05:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-16 21:05:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-16 21:05:03,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:03,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100548159] [2021-11-16 21:05:03,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100548159] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:03,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645898011] [2021-11-16 21:05:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:03,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:03,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:03,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:03,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 21:05:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:03,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-16 21:05:03,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:04,797 WARN L860 $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 [2021-11-16 21:05:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-11-16 21:05:11,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:11,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645898011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:11,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:11,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2021-11-16 21:05:11,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322728148] [2021-11-16 21:05:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:11,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:05:11,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:11,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:05:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=202, Unknown=3, NotChecked=28, Total=272 [2021-11-16 21:05:11,081 INFO L87 Difference]: Start difference. First operand 177 states and 227 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (27), 2 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:05:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:12,110 INFO L93 Difference]: Finished difference Result 331 states and 436 transitions. [2021-11-16 21:05:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:05:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (27), 2 states have call predecessors, (27), 3 states have call successors, (27) Word has length 173 [2021-11-16 21:05:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:12,112 INFO L225 Difference]: With dead ends: 331 [2021-11-16 21:05:12,112 INFO L226 Difference]: Without dead ends: 180 [2021-11-16 21:05:12,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=54, Invalid=253, Unknown=3, NotChecked=32, Total=342 [2021-11-16 21:05:12,113 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 5 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:12,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1124 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 302 Unchecked, 1.0s Time] [2021-11-16 21:05:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-16 21:05:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2021-11-16 21:05:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 116 states have (on average 1.1982758620689655) internal successors, (139), 116 states have internal predecessors, (139), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (46), 44 states have call predecessors, (46), 43 states have call successors, (46) [2021-11-16 21:05:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 229 transitions. [2021-11-16 21:05:12,122 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 229 transitions. Word has length 173 [2021-11-16 21:05:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:12,123 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 229 transitions. [2021-11-16 21:05:12,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (27), 2 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:05:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 229 transitions. [2021-11-16 21:05:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-16 21:05:12,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:12,125 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:12,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:12,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-16 21:05:12,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1330201512, now seen corresponding path program 1 times [2021-11-16 21:05:12,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:12,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465155781] [2021-11-16 21:05:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:12,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:05:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 21:05:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 21:05:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 21:05:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-16 21:05:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-16 21:05:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-11-16 21:05:12,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:12,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465155781] [2021-11-16 21:05:12,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465155781] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:12,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246711152] [2021-11-16 21:05:12,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:12,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:12,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:12,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-16 21:05:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-16 21:05:13,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:13,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-16 21:05:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-11-16 21:05:13,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:13,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246711152] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:13,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:13,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2021-11-16 21:05:13,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288342565] [2021-11-16 21:05:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:13,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:05:13,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:05:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-16 21:05:13,544 INFO L87 Difference]: Start difference. First operand 179 states and 229 transitions. Second operand has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2021-11-16 21:05:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:13,572 INFO L93 Difference]: Finished difference Result 332 states and 424 transitions. [2021-11-16 21:05:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:05:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 178 [2021-11-16 21:05:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:13,574 INFO L225 Difference]: With dead ends: 332 [2021-11-16 21:05:13,574 INFO L226 Difference]: Without dead ends: 182 [2021-11-16 21:05:13,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:05:13,575 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 20 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:13,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 903 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 80 Unchecked, 0.0s Time] [2021-11-16 21:05:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-16 21:05:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-11-16 21:05:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 118 states have internal predecessors, (142), 44 states have call successors, (44), 19 states have call predecessors, (44), 18 states have return successors, (46), 44 states have call predecessors, (46), 43 states have call successors, (46) [2021-11-16 21:05:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2021-11-16 21:05:13,582 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 178 [2021-11-16 21:05:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:13,593 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2021-11-16 21:05:13,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2021-11-16 21:05:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2021-11-16 21:05:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 21:05:13,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:13,595 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:13,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:13,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:13,796 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1571474099, now seen corresponding path program 1 times [2021-11-16 21:05:13,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:13,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611377176] [2021-11-16 21:05:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:13,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 21:05:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 21:05:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:05:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-16 21:05:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-16 21:05:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-16 21:05:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2021-11-16 21:05:14,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:14,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611377176] [2021-11-16 21:05:14,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611377176] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:14,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913498109] [2021-11-16 21:05:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:14,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:14,294 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:14,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-16 21:05:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:14,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-16 21:05:14,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-16 21:05:14,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:14,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913498109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:14,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:14,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2021-11-16 21:05:14,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483758819] [2021-11-16 21:05:14,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:14,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:05:14,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:14,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:05:14,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2021-11-16 21:05:14,944 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 9 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2021-11-16 21:05:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:15,041 INFO L93 Difference]: Finished difference Result 340 states and 447 transitions. [2021-11-16 21:05:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:05:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 187 [2021-11-16 21:05:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:15,043 INFO L225 Difference]: With dead ends: 340 [2021-11-16 21:05:15,043 INFO L226 Difference]: Without dead ends: 191 [2021-11-16 21:05:15,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2021-11-16 21:05:15,045 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:15,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1526 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:05:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-16 21:05:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-11-16 21:05:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.184) internal successors, (148), 126 states have internal predecessors, (148), 44 states have call successors, (44), 19 states have call predecessors, (44), 21 states have return successors, (55), 45 states have call predecessors, (55), 43 states have call successors, (55) [2021-11-16 21:05:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2021-11-16 21:05:15,052 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 187 [2021-11-16 21:05:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:15,053 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2021-11-16 21:05:15,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.625) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2021-11-16 21:05:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2021-11-16 21:05:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-16 21:05:15,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:15,055 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:15,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:15,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-16 21:05:15,271 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash -715385865, now seen corresponding path program 1 times [2021-11-16 21:05:15,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:15,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373439723] [2021-11-16 21:05:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:15,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-16 21:05:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-16 21:05:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-11-16 21:05:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-11-16 21:05:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2021-11-16 21:05:15,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:15,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373439723] [2021-11-16 21:05:15,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373439723] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:15,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913693454] [2021-11-16 21:05:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:15,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:15,833 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:15,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-16 21:05:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:16,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 2615 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-16 21:05:16,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:16,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-16 21:05:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 175 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-16 21:05:16,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:05:17,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913693454] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:17,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:05:17,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2021-11-16 21:05:17,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666225106] [2021-11-16 21:05:17,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:05:17,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-16 21:05:17,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:17,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-16 21:05:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2021-11-16 21:05:17,187 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand has 25 states, 22 states have (on average 7.0) internal successors, (154), 19 states have internal predecessors, (154), 12 states have call successors, (60), 10 states have call predecessors, (60), 7 states have return successors, (51), 9 states have call predecessors, (51), 12 states have call successors, (51) [2021-11-16 21:05:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:19,642 INFO L93 Difference]: Finished difference Result 382 states and 509 transitions. [2021-11-16 21:05:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-16 21:05:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 19 states have internal predecessors, (154), 12 states have call successors, (60), 10 states have call predecessors, (60), 7 states have return successors, (51), 9 states have call predecessors, (51), 12 states have call successors, (51) Word has length 200 [2021-11-16 21:05:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:19,645 INFO L225 Difference]: With dead ends: 382 [2021-11-16 21:05:19,645 INFO L226 Difference]: Without dead ends: 278 [2021-11-16 21:05:19,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 310 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2021-11-16 21:05:19,647 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 354 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:19,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 1698 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1610 Invalid, 0 Unknown, 597 Unchecked, 2.2s Time] [2021-11-16 21:05:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-16 21:05:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 251. [2021-11-16 21:05:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 168 states have (on average 1.2023809523809523) internal successors, (202), 174 states have internal predecessors, (202), 51 states have call successors, (51), 24 states have call predecessors, (51), 31 states have return successors, (77), 52 states have call predecessors, (77), 50 states have call successors, (77) [2021-11-16 21:05:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 330 transitions. [2021-11-16 21:05:19,661 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 330 transitions. Word has length 200 [2021-11-16 21:05:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:19,661 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 330 transitions. [2021-11-16 21:05:19,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 19 states have internal predecessors, (154), 12 states have call successors, (60), 10 states have call predecessors, (60), 7 states have return successors, (51), 9 states have call predecessors, (51), 12 states have call successors, (51) [2021-11-16 21:05:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 330 transitions. [2021-11-16 21:05:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 21:05:19,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:19,663 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:19,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:19,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-16 21:05:19,891 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash -979169190, now seen corresponding path program 1 times [2021-11-16 21:05:19,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:19,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918963553] [2021-11-16 21:05:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:19,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 21:05:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 21:05:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-16 21:05:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 21:05:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-11-16 21:05:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-16 21:05:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2021-11-16 21:05:20,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:20,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918963553] [2021-11-16 21:05:20,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918963553] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:20,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579872206] [2021-11-16 21:05:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:20,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:20,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:20,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:20,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-16 21:05:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:20,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 2626 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:05:20,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-11-16 21:05:21,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:21,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579872206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:21,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:21,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 13 [2021-11-16 21:05:21,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901558021] [2021-11-16 21:05:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:21,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:05:21,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:05:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:05:21,024 INFO L87 Difference]: Start difference. First operand 251 states and 330 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:05:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:21,048 INFO L93 Difference]: Finished difference Result 464 states and 624 transitions. [2021-11-16 21:05:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:05:21,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 210 [2021-11-16 21:05:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:21,050 INFO L225 Difference]: With dead ends: 464 [2021-11-16 21:05:21,050 INFO L226 Difference]: Without dead ends: 244 [2021-11-16 21:05:21,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:05:21,052 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:21,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 611 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:05:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-16 21:05:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-11-16 21:05:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 163 states have (on average 1.196319018404908) internal successors, (195), 169 states have internal predecessors, (195), 50 states have call successors, (50), 23 states have call predecessors, (50), 30 states have return successors, (73), 51 states have call predecessors, (73), 49 states have call successors, (73) [2021-11-16 21:05:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 318 transitions. [2021-11-16 21:05:21,061 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 318 transitions. Word has length 210 [2021-11-16 21:05:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:21,061 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 318 transitions. [2021-11-16 21:05:21,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:05:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 318 transitions. [2021-11-16 21:05:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-11-16 21:05:21,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:21,063 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:21,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:21,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-16 21:05:21,263 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash 39081338, now seen corresponding path program 1 times [2021-11-16 21:05:21,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:21,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633310799] [2021-11-16 21:05:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:21,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-16 21:05:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-16 21:05:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-16 21:05:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-11-16 21:05:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-11-16 21:05:21,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:21,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633310799] [2021-11-16 21:05:21,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633310799] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:21,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379649056] [2021-11-16 21:05:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:21,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:21,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:21,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-16 21:05:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:22,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-16 21:05:22,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:05:22,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:22,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379649056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:22,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:22,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 30 [2021-11-16 21:05:22,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113120162] [2021-11-16 21:05:22,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:22,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:05:22,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:05:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2021-11-16 21:05:22,780 INFO L87 Difference]: Start difference. First operand 244 states and 318 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (28), 2 states have call predecessors, (28), 5 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:05:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:22,901 INFO L93 Difference]: Finished difference Result 341 states and 450 transitions. [2021-11-16 21:05:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:05:22,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (28), 2 states have call predecessors, (28), 5 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 209 [2021-11-16 21:05:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:22,903 INFO L225 Difference]: With dead ends: 341 [2021-11-16 21:05:22,903 INFO L226 Difference]: Without dead ends: 237 [2021-11-16 21:05:22,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2021-11-16 21:05:22,904 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 2 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:22,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1519 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:05:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-16 21:05:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2021-11-16 21:05:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 157 states have (on average 1.178343949044586) internal successors, (185), 161 states have internal predecessors, (185), 50 states have call successors, (50), 23 states have call predecessors, (50), 27 states have return successors, (64), 50 states have call predecessors, (64), 49 states have call successors, (64) [2021-11-16 21:05:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2021-11-16 21:05:22,912 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 209 [2021-11-16 21:05:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:22,913 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2021-11-16 21:05:22,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (28), 2 states have call predecessors, (28), 5 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:05:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2021-11-16 21:05:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-11-16 21:05:22,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:22,914 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2021-11-16 21:05:22,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:23,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-16 21:05:23,120 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1075459652, now seen corresponding path program 1 times [2021-11-16 21:05:23,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:23,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678391735] [2021-11-16 21:05:23,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:23,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:23,157 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:05:23,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058579125] [2021-11-16 21:05:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:23,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:23,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:23,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-16 21:05:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:23,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 2790 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:05:23,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-16 21:05:23,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:23,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:23,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678391735] [2021-11-16 21:05:23,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:05:23,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058579125] [2021-11-16 21:05:23,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058579125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:23,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:05:23,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:05:23,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588400592] [2021-11-16 21:05:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:23,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:05:23,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:23,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:05:23,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:05:23,808 INFO L87 Difference]: Start difference. First operand 235 states and 299 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:05:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:23,832 INFO L93 Difference]: Finished difference Result 460 states and 586 transitions. [2021-11-16 21:05:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:05:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 228 [2021-11-16 21:05:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:23,845 INFO L225 Difference]: With dead ends: 460 [2021-11-16 21:05:23,845 INFO L226 Difference]: Without dead ends: 237 [2021-11-16 21:05:23,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:05:23,846 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 2 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:23,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 812 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:05:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-16 21:05:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2021-11-16 21:05:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 162 states have internal predecessors, (187), 50 states have call successors, (50), 23 states have call predecessors, (50), 27 states have return successors, (64), 51 states have call predecessors, (64), 49 states have call successors, (64) [2021-11-16 21:05:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 301 transitions. [2021-11-16 21:05:23,854 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 301 transitions. Word has length 228 [2021-11-16 21:05:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:23,855 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 301 transitions. [2021-11-16 21:05:23,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:05:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 301 transitions. [2021-11-16 21:05:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-11-16 21:05:23,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:23,856 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:23,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:24,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:24,075 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1909848278, now seen corresponding path program 1 times [2021-11-16 21:05:24,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:24,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537739514] [2021-11-16 21:05:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:24,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-16 21:05:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-16 21:05:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-16 21:05:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-11-16 21:05:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2021-11-16 21:05:24,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:24,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537739514] [2021-11-16 21:05:24,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537739514] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:24,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181241108] [2021-11-16 21:05:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:24,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:24,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:24,966 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:24,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-16 21:05:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:25,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 2712 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-16 21:05:25,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-16 21:05:25,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:05:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2021-11-16 21:05:26,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181241108] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:26,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:05:26,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25, 12] total 40 [2021-11-16 21:05:26,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656566157] [2021-11-16 21:05:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:26,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:05:26,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:05:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2021-11-16 21:05:26,527 INFO L87 Difference]: Start difference. First operand 237 states and 301 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 21:05:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:26,637 INFO L93 Difference]: Finished difference Result 321 states and 414 transitions. [2021-11-16 21:05:26,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:05:26,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 222 [2021-11-16 21:05:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:26,639 INFO L225 Difference]: With dead ends: 321 [2021-11-16 21:05:26,639 INFO L226 Difference]: Without dead ends: 237 [2021-11-16 21:05:26,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2021-11-16 21:05:26,640 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 3 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:26,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1529 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:05:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-16 21:05:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2021-11-16 21:05:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 162 states have internal predecessors, (187), 50 states have call successors, (50), 23 states have call predecessors, (50), 27 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2021-11-16 21:05:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 299 transitions. [2021-11-16 21:05:26,649 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 299 transitions. Word has length 222 [2021-11-16 21:05:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:26,649 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 299 transitions. [2021-11-16 21:05:26,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 21:05:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 299 transitions. [2021-11-16 21:05:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-11-16 21:05:26,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:26,651 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:26,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:26,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 21:05:26,873 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash -696080334, now seen corresponding path program 1 times [2021-11-16 21:05:26,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:26,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903867006] [2021-11-16 21:05:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:26,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-16 21:05:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 21:05:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 21:05:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:05:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:05:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 21:05:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:05:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:05:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-16 21:05:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-16 21:05:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-11-16 21:05:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-11-16 21:05:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:05:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-16 21:05:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:05:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-16 21:05:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-11-16 21:05:27,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:27,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903867006] [2021-11-16 21:05:27,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903867006] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:27,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147485277] [2021-11-16 21:05:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:27,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:27,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:27,558 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-16 21:05:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:27,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-16 21:05:27,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-16 21:05:28,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:28,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147485277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:28,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:28,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2021-11-16 21:05:28,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159160333] [2021-11-16 21:05:28,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:28,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:05:28,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:05:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:05:28,318 INFO L87 Difference]: Start difference. First operand 237 states and 299 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-11-16 21:05:31,361 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:31,668 INFO L93 Difference]: Finished difference Result 466 states and 587 transitions. [2021-11-16 21:05:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:05:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 233 [2021-11-16 21:05:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:31,670 INFO L225 Difference]: With dead ends: 466 [2021-11-16 21:05:31,670 INFO L226 Difference]: Without dead ends: 241 [2021-11-16 21:05:31,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:05:31,671 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 164 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:31,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 622 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2021-11-16 21:05:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-16 21:05:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-11-16 21:05:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 161 states have (on average 1.173913043478261) internal successors, (189), 166 states have internal predecessors, (189), 50 states have call successors, (50), 23 states have call predecessors, (50), 29 states have return successors, (64), 51 states have call predecessors, (64), 49 states have call successors, (64) [2021-11-16 21:05:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 303 transitions. [2021-11-16 21:05:31,680 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 303 transitions. Word has length 233 [2021-11-16 21:05:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:31,681 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 303 transitions. [2021-11-16 21:05:31,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-11-16 21:05:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 303 transitions. [2021-11-16 21:05:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-11-16 21:05:31,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:31,682 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:31,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:31,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-16 21:05:31,895 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 883605678, now seen corresponding path program 1 times [2021-11-16 21:05:31,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:31,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999516574] [2021-11-16 21:05:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:31,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:31,926 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:05:31,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210526429] [2021-11-16 21:05:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:31,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:31,927 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:31,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-16 21:05:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:32,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:05:32,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-11-16 21:05:32,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:32,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:32,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999516574] [2021-11-16 21:05:32,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:05:32,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210526429] [2021-11-16 21:05:32,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210526429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:32,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:05:32,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:05:32,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035398546] [2021-11-16 21:05:32,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:32,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:05:32,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:05:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:05:32,627 INFO L87 Difference]: Start difference. First operand 241 states and 303 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2021-11-16 21:05:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:32,658 INFO L93 Difference]: Finished difference Result 465 states and 585 transitions. [2021-11-16 21:05:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:05:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) Word has length 251 [2021-11-16 21:05:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:32,662 INFO L225 Difference]: With dead ends: 465 [2021-11-16 21:05:32,662 INFO L226 Difference]: Without dead ends: 236 [2021-11-16 21:05:32,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:05:32,663 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:32,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1229 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:05:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-16 21:05:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-11-16 21:05:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 158 states have (on average 1.1645569620253164) internal successors, (184), 162 states have internal predecessors, (184), 49 states have call successors, (49), 23 states have call predecessors, (49), 28 states have return successors, (60), 50 states have call predecessors, (60), 48 states have call successors, (60) [2021-11-16 21:05:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 293 transitions. [2021-11-16 21:05:32,673 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 293 transitions. Word has length 251 [2021-11-16 21:05:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:32,673 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 293 transitions. [2021-11-16 21:05:32,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2021-11-16 21:05:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 293 transitions. [2021-11-16 21:05:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-11-16 21:05:32,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:32,675 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:32,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:32,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-16 21:05:32,896 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1453240668, now seen corresponding path program 1 times [2021-11-16 21:05:32,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:32,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715587635] [2021-11-16 21:05:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:32,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:32,919 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:05:32,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801930722] [2021-11-16 21:05:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:32,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:32,921 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:32,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-16 21:05:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:33,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-16 21:05:33,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:33,605 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-16 21:05:33,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2021-11-16 21:05:33,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2021-11-16 21:05:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2021-11-16 21:05:33,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:05:33,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 178 treesize of output 166 [2021-11-16 21:05:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-11-16 21:05:34,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:34,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715587635] [2021-11-16 21:05:34,214 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:05:34,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801930722] [2021-11-16 21:05:34,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801930722] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:34,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:34,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 14 [2021-11-16 21:05:34,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387319612] [2021-11-16 21:05:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:34,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:05:34,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:34,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:05:34,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:05:34,216 INFO L87 Difference]: Start difference. First operand 236 states and 293 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:05:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:34,688 INFO L93 Difference]: Finished difference Result 255 states and 318 transitions. [2021-11-16 21:05:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:05:34,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 245 [2021-11-16 21:05:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:34,690 INFO L225 Difference]: With dead ends: 255 [2021-11-16 21:05:34,690 INFO L226 Difference]: Without dead ends: 253 [2021-11-16 21:05:34,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:05:34,691 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 19 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:34,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1305 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 21:05:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-16 21:05:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2021-11-16 21:05:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 169 states have internal predecessors, (191), 50 states have call successors, (50), 24 states have call predecessors, (50), 30 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2021-11-16 21:05:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 303 transitions. [2021-11-16 21:05:34,699 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 303 transitions. Word has length 245 [2021-11-16 21:05:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:34,700 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 303 transitions. [2021-11-16 21:05:34,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:05:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 303 transitions. [2021-11-16 21:05:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-11-16 21:05:34,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:34,701 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2021-11-16 21:05:34,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:34,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-16 21:05:34,922 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash 338829491, now seen corresponding path program 1 times [2021-11-16 21:05:34,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:34,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449987573] [2021-11-16 21:05:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:34,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:34,945 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:05:34,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545492251] [2021-11-16 21:05:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:34,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:34,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:34,947 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:34,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-16 21:05:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:35,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2853 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-16 21:05:35,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:35,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2021-11-16 21:05:36,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2021-11-16 21:05:36,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:36,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:05:36,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2021-11-16 21:05:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-11-16 21:05:36,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:05:36,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:36,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449987573] [2021-11-16 21:05:36,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:05:36,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545492251] [2021-11-16 21:05:36,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545492251] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:36,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:05:36,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-16 21:05:36,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128073558] [2021-11-16 21:05:36,677 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 21:05:36,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-16 21:05:36,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:36,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-16 21:05:36,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-11-16 21:05:36,679 INFO L87 Difference]: Start difference. First operand 245 states and 303 transitions. Second operand has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 10 states have call successors, (36), 7 states have call predecessors, (36), 4 states have return successors, (33), 8 states have call predecessors, (33), 9 states have call successors, (33) [2021-11-16 21:05:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:37,780 INFO L93 Difference]: Finished difference Result 419 states and 522 transitions. [2021-11-16 21:05:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-16 21:05:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 10 states have call successors, (36), 7 states have call predecessors, (36), 4 states have return successors, (33), 8 states have call predecessors, (33), 9 states have call successors, (33) Word has length 241 [2021-11-16 21:05:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:37,782 INFO L225 Difference]: With dead ends: 419 [2021-11-16 21:05:37,782 INFO L226 Difference]: Without dead ends: 327 [2021-11-16 21:05:37,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 300 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2021-11-16 21:05:37,784 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 105 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 973 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:37,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 1523 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 625 Invalid, 0 Unknown, 973 Unchecked, 0.9s Time] [2021-11-16 21:05:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-16 21:05:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 307. [2021-11-16 21:05:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 211 states have (on average 1.180094786729858) internal successors, (249), 215 states have internal predecessors, (249), 59 states have call successors, (59), 31 states have call predecessors, (59), 36 states have return successors, (74), 60 states have call predecessors, (74), 58 states have call successors, (74) [2021-11-16 21:05:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2021-11-16 21:05:37,794 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 241 [2021-11-16 21:05:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:37,795 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2021-11-16 21:05:37,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 10 states have call successors, (36), 7 states have call predecessors, (36), 4 states have return successors, (33), 8 states have call predecessors, (33), 9 states have call successors, (33) [2021-11-16 21:05:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2021-11-16 21:05:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-16 21:05:37,796 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:37,796 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:37,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:38,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:38,017 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -158946309, now seen corresponding path program 1 times [2021-11-16 21:05:38,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:38,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725210665] [2021-11-16 21:05:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:38,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:38,042 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:05:38,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080870261] [2021-11-16 21:05:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:38,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:38,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:38,044 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:38,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-16 21:05:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:38,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 2947 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-16 21:05:38,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:39,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2021-11-16 21:05:39,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:39,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-16 21:05:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-11-16 21:05:39,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:05:39,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:39,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725210665] [2021-11-16 21:05:39,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:05:39,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080870261] [2021-11-16 21:05:39,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080870261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:39,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:05:39,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-16 21:05:39,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497060328] [2021-11-16 21:05:39,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:39,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-16 21:05:39,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:39,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-16 21:05:39,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:05:39,317 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 14 states have internal predecessors, (91), 9 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) [2021-11-16 21:05:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:39,550 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2021-11-16 21:05:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 21:05:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 14 states have internal predecessors, (91), 9 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) Word has length 253 [2021-11-16 21:05:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:39,552 INFO L225 Difference]: With dead ends: 405 [2021-11-16 21:05:39,552 INFO L226 Difference]: Without dead ends: 321 [2021-11-16 21:05:39,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:05:39,553 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 44 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:39,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1799 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2021-11-16 21:05:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-11-16 21:05:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2021-11-16 21:05:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 220 states have (on average 1.1727272727272726) internal successors, (258), 223 states have internal predecessors, (258), 59 states have call successors, (59), 34 states have call predecessors, (59), 38 states have return successors, (74), 60 states have call predecessors, (74), 58 states have call successors, (74) [2021-11-16 21:05:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 391 transitions. [2021-11-16 21:05:39,564 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 391 transitions. Word has length 253 [2021-11-16 21:05:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:39,564 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 391 transitions. [2021-11-16 21:05:39,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 14 states have internal predecessors, (91), 9 states have call successors, (32), 6 states have call predecessors, (32), 4 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) [2021-11-16 21:05:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 391 transitions. [2021-11-16 21:05:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-11-16 21:05:39,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:39,566 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-16 21:05:39,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:39,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:39,779 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1408230311, now seen corresponding path program 1 times [2021-11-16 21:05:39,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:39,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588657227] [2021-11-16 21:05:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:39,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:39,805 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:05:39,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449804243] [2021-11-16 21:05:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:39,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:39,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:39,806 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:39,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-16 21:06:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:06:01,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 562 conjunts are in the unsatisfiable core [2021-11-16 21:06:01,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:06:01,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-16 21:06:01,979 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 21:06:01,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-16 21:06:02,041 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-16 21:06:02,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2021-11-16 21:06:02,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 21:06:02,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-11-16 21:06:02,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-16 21:06:02,918 INFO L354 Elim1Store]: treesize reduction 211, result has 10.2 percent of original size [2021-11-16 21:06:02,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 97 [2021-11-16 21:06:03,978 INFO L354 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2021-11-16 21:06:03,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2021-11-16 21:06:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 146 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2021-11-16 21:06:04,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:06:06,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:06:06,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588657227] [2021-11-16 21:06:06,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:06:06,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449804243] [2021-11-16 21:06:06,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449804243] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:06:06,094 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:06:06,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2021-11-16 21:06:06,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265480689] [2021-11-16 21:06:06,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-16 21:06:06,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-16 21:06:06,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:06:06,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-16 21:06:06,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2021-11-16 21:06:06,095 INFO L87 Difference]: Start difference. First operand 318 states and 391 transitions. Second operand has 35 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 25 states have internal predecessors, (104), 11 states have call successors, (34), 6 states have call predecessors, (34), 10 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2021-11-16 21:06:07,463 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:06:09,511 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:06:11,576 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:06:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:06:12,606 INFO L93 Difference]: Finished difference Result 668 states and 812 transitions. [2021-11-16 21:06:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-16 21:06:12,607 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 25 states have internal predecessors, (104), 11 states have call successors, (34), 6 states have call predecessors, (34), 10 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) Word has length 267 [2021-11-16 21:06:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:06:12,608 INFO L225 Difference]: With dead ends: 668 [2021-11-16 21:06:12,608 INFO L226 Difference]: Without dead ends: 346 [2021-11-16 21:06:12,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 337 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2021-11-16 21:06:12,609 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 34 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1043 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:06:12,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1594 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 2 Unknown, 1043 Unchecked, 6.5s Time] [2021-11-16 21:06:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-11-16 21:06:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2021-11-16 21:06:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 238 states have (on average 1.1596638655462186) internal successors, (276), 240 states have internal predecessors, (276), 63 states have call successors, (63), 41 states have call predecessors, (63), 43 states have return successors, (78), 63 states have call predecessors, (78), 62 states have call successors, (78) [2021-11-16 21:06:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 417 transitions. [2021-11-16 21:06:12,623 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 417 transitions. Word has length 267 [2021-11-16 21:06:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:06:12,624 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 417 transitions. [2021-11-16 21:06:12,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 25 states have internal predecessors, (104), 11 states have call successors, (34), 6 states have call predecessors, (34), 10 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2021-11-16 21:06:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 417 transitions. [2021-11-16 21:06:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-11-16 21:06:12,625 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:06:12,626 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2021-11-16 21:06:12,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-16 21:06:12,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:06:12,843 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:06:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:06:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1088599780, now seen corresponding path program 1 times [2021-11-16 21:06:12,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:06:12,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036164160] [2021-11-16 21:06:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:06:12,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:06:12,872 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:06:12,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298808574] [2021-11-16 21:06:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:06:12,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:06:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:06:12,874 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:06:12,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-16 21:06:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:06:13,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:06:13,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:06:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2021-11-16 21:06:13,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:06:13,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:06:13,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036164160] [2021-11-16 21:06:13,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:06:13,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298808574] [2021-11-16 21:06:13,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298808574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:06:13,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:06:13,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:06:13,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523557835] [2021-11-16 21:06:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:06:13,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:06:13,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:06:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:06:13,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:06:13,677 INFO L87 Difference]: Start difference. First operand 345 states and 417 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:06:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:06:13,693 INFO L93 Difference]: Finished difference Result 358 states and 429 transitions. [2021-11-16 21:06:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:06:13,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 256 [2021-11-16 21:06:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:06:13,694 INFO L225 Difference]: With dead ends: 358 [2021-11-16 21:06:13,694 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 21:06:13,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:06:13,695 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:06:13,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 280 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:06:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 21:06:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 21:06:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-16 21:06:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 21:06:13,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2021-11-16 21:06:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:06:13,696 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 21:06:13,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:06:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 21:06:13,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 21:06:13,699 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 21:06:13,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-16 21:06:13,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:06:13,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 21:06:14,735 INFO L858 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2021-11-16 21:06:14,735 INFO L854 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (= (+ (* 442721857769029238784 |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|) (* 24 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 8)))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:06:14,735 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (= (+ (* 442721857769029238784 |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|) (* 24 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 8))))) [2021-11-16 21:06:14,736 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2021-11-16 21:06:14,736 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2021-11-16 21:06:14,736 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-16 21:06:14,736 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-16 21:06:14,736 INFO L861 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 9988 9991) the Hoare annotation is: true [2021-11-16 21:06:14,736 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 9988 9991) no Hoare annotation was computed. [2021-11-16 21:06:14,736 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L861 garLoopResultBuilder]: At program point L9990-4(line 9990) the Hoare annotation is: true [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 9988 9991) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L861 garLoopResultBuilder]: At program point aws_hash_iter_nextENTRY(lines 9858 9869) the Hoare annotation is: true [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point L9859-2(line 9859) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point aws_hash_iter_nextEXIT(lines 9858 9869) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L861 garLoopResultBuilder]: At program point L9868(line 9868) the Hoare annotation is: true [2021-11-16 21:06:14,743 INFO L861 garLoopResultBuilder]: At program point L9868-1(line 9868) the Hoare annotation is: true [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point L9868-2(line 9868) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L858 garLoopResultBuilder]: For program point L9862-1(line 9862) no Hoare annotation was computed. [2021-11-16 21:06:14,743 INFO L861 garLoopResultBuilder]: At program point L9859(line 9859) the Hoare annotation is: true [2021-11-16 21:06:14,755 INFO L861 garLoopResultBuilder]: At program point L9859-1(line 9859) the Hoare annotation is: true [2021-11-16 21:06:14,755 INFO L858 garLoopResultBuilder]: For program point aws_hash_iter_nextFINAL(lines 9858 9869) no Hoare annotation was computed. [2021-11-16 21:06:14,755 INFO L858 garLoopResultBuilder]: For program point L9865(line 9865) no Hoare annotation was computed. [2021-11-16 21:06:14,755 INFO L861 garLoopResultBuilder]: At program point L9865-2(line 9865) the Hoare annotation is: true [2021-11-16 21:06:14,755 INFO L861 garLoopResultBuilder]: At program point L9862(line 9862) the Hoare annotation is: true [2021-11-16 21:06:14,755 INFO L858 garLoopResultBuilder]: For program point L9865-3(line 9865) no Hoare annotation was computed. [2021-11-16 21:06:14,755 INFO L854 garLoopResultBuilder]: At program point L10108(line 10108) the Hoare annotation is: (or (and (= (* 24 |hash_table_state_required_bytes_#in~size|) |hash_table_state_required_bytes_#t~mem1322|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_88| Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1))) (and (= |#valid| (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_88| 0)) (= (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_88|) 0))))) (not (< 0 |#StackHeapBarrier|))) [2021-11-16 21:06:14,756 INFO L854 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10101 10113) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10108-1(line 10108) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L854 garLoopResultBuilder]: At program point L10104(line 10104) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1) |#valid|) (= |#memory_int| |old(#memory_int)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0))) [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10104-1(line 10104) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10101 10113) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10101 10113) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10075(lines 10075 10088) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10079(line 10079) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10069(lines 10069 10073) no Hoare annotation was computed. [2021-11-16 21:06:14,756 INFO L861 garLoopResultBuilder]: At program point aws_hash_iter_is_validENTRY(lines 10052 10093) the Hoare annotation is: true [2021-11-16 21:06:14,756 INFO L858 garLoopResultBuilder]: For program point L10059(lines 10059 10063) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10082(lines 10082 10083) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10076(line 10076) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10082-2(lines 10082 10083) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point aws_hash_iter_is_validEXIT(lines 10052 10093) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L861 garLoopResultBuilder]: At program point L10064(line 10064) the Hoare annotation is: true [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10064-1(lines 10064 10068) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10085(line 10085) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10087-2(line 10087) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point aws_hash_iter_is_validFINAL(lines 10052 10093) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10087(line 10087) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L10054(lines 10054 10058) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L854 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2021-11-16 21:06:14,757 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0)) (not (< 0 |#StackHeapBarrier|)) (and (exists ((|v___CPROVER_overflow_mult_~#c~1.base_88| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_88|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_88| 0) |#valid|))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= (* |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_#in~b#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0))) [2021-11-16 21:06:14,757 INFO L854 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2021-11-16 21:06:14,757 INFO L858 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2021-11-16 21:06:14,757 INFO L854 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (and (exists ((|v___CPROVER_overflow_mult_~#c~1.base_88| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_88|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_88| 0) |#valid|))) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|)) (not (< 0 |#StackHeapBarrier|))) [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 9999 10046) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point L10027(line 10027) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point L10027-1(line 10027) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 9999 10046) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 9999 10046) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point L9796-3(lines 9796 9805) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point L9792(line 9792) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point L9796-4(lines 9796 9805) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point L9792-1(line 9792) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point L9792-2(line 9792) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point s_get_next_elementEXIT(lines 9788 9815) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point L9799(lines 9799 9804) no Hoare annotation was computed. [2021-11-16 21:06:14,758 INFO L861 garLoopResultBuilder]: At program point L9789(lines 9789 9791) the Hoare annotation is: true [2021-11-16 21:06:14,758 INFO L858 garLoopResultBuilder]: For program point L9789-1(lines 9789 9791) no Hoare annotation was computed. [2021-11-16 21:06:14,759 INFO L861 garLoopResultBuilder]: At program point L9814-1(line 9814) the Hoare annotation is: true [2021-11-16 21:06:14,759 INFO L858 garLoopResultBuilder]: For program point L9814-2(line 9814) no Hoare annotation was computed. [2021-11-16 21:06:14,759 INFO L861 garLoopResultBuilder]: At program point s_get_next_elementENTRY(lines 9788 9815) the Hoare annotation is: true [2021-11-16 21:06:14,759 INFO L861 garLoopResultBuilder]: At program point L9814(line 9814) the Hoare annotation is: true [2021-11-16 21:06:14,759 INFO L858 garLoopResultBuilder]: For program point L9796-2(lines 9796 9805) no Hoare annotation was computed. [2021-11-16 21:06:14,759 INFO L858 garLoopResultBuilder]: For program point s_get_next_elementFINAL(lines 9788 9815) no Hoare annotation was computed. [2021-11-16 21:06:14,759 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:06:14,759 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 21:06:14,760 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 21:06:14,760 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 21:06:14,760 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2021-11-16 21:06:14,760 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-11-16 21:06:14,760 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-16 21:06:14,760 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-11-16 21:06:14,761 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-11-16 21:06:14,761 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2021-11-16 21:06:14,761 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2021-11-16 21:06:14,761 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2021-11-16 21:06:14,761 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2021-11-16 21:06:14,761 INFO L861 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2021-11-16 21:06:14,762 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_88| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_88|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_88| 0) |#valid|))) (= |aws_add_size_checked_aws_add_u64_checked_#res#1| 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|))) [2021-11-16 21:06:14,762 INFO L854 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2021-11-16 21:06:14,762 INFO L854 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2021-11-16 21:06:14,762 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-11-16 21:06:14,762 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|))) [2021-11-16 21:06:14,762 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-16 21:06:14,762 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2021-11-16 21:06:14,763 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2021-11-16 21:06:14,763 INFO L858 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2021-11-16 21:06:14,763 INFO L854 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|)) [2021-11-16 21:06:14,763 INFO L854 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|)) [2021-11-16 21:06:14,763 INFO L854 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-16 21:06:14,763 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-16 21:06:14,763 INFO L858 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2021-11-16 21:06:14,764 INFO L854 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|)) (.cse3 (< 0 |#StackHeapBarrier|))) (or (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_53| Int) (|v___CPROVER_overflow_mult_~#c~1.base_88| Int)) (and (= (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_88|) 0) (not (= |v_hash_table_state_required_bytes_~#elemsize~0.base_53| |v___CPROVER_overflow_mult_~#c~1.base_88|)) (= (select |#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_53|) 0))) .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|)) .cse2 (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 0) .cse3) (and (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) (< 1 |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) .cse0 .cse1 .cse2 .cse3))) [2021-11-16 21:06:14,764 INFO L858 garLoopResultBuilder]: For program point L10131(line 10131) no Hoare annotation was computed. [2021-11-16 21:06:14,764 INFO L861 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: true [2021-11-16 21:06:14,764 INFO L854 garLoopResultBuilder]: At program point L10131-2(line 10131) the Hoare annotation is: false [2021-11-16 21:06:14,764 INFO L858 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-11-16 21:06:14,764 INFO L858 garLoopResultBuilder]: For program point L10131-3(line 10131) no Hoare annotation was computed. [2021-11-16 21:06:14,764 INFO L854 garLoopResultBuilder]: At program point L10127(line 10127) the Hoare annotation is: false [2021-11-16 21:06:14,764 INFO L854 garLoopResultBuilder]: At program point L10127-1(line 10127) the Hoare annotation is: false [2021-11-16 21:06:14,764 INFO L854 garLoopResultBuilder]: At program point L7270(line 7270) the Hoare annotation is: false [2021-11-16 21:06:14,764 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point L7270-3(line 7270) no Hoare annotation was computed. [2021-11-16 21:06:14,765 INFO L854 garLoopResultBuilder]: At program point L7270-2(line 7270) the Hoare annotation is: false [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point L7270-1(line 7270) no Hoare annotation was computed. [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 21:06:14,765 INFO L854 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0))) (and (exists ((|v_hash_table_state_required_bytes_~#elemsize~0.base_53| Int) (|v___CPROVER_overflow_mult_~#c~1.base_88| Int)) (and (= (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_88|) 0) (not (= |v_hash_table_state_required_bytes_~#elemsize~0.base_53| |v___CPROVER_overflow_mult_~#c~1.base_88|)) (= (select |#valid| |v_hash_table_state_required_bytes_~#elemsize~0.base_53|) 0))) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0) (= (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|) (+ .cse0 29629528)) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|)) (= .cse0 |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|))) [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 21:06:14,765 INFO L858 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2021-11-16 21:06:14,766 INFO L854 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (< 0 |#StackHeapBarrier|)) [2021-11-16 21:06:14,766 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-16 21:06:14,766 INFO L854 garLoopResultBuilder]: At program point L10132(line 10132) the Hoare annotation is: false [2021-11-16 21:06:14,766 INFO L854 garLoopResultBuilder]: At program point L10132-1(line 10132) the Hoare annotation is: false [2021-11-16 21:06:14,766 INFO L858 garLoopResultBuilder]: For program point L10132-2(line 10132) no Hoare annotation was computed. [2021-11-16 21:06:14,766 INFO L858 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-11-16 21:06:14,766 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 21:06:14,766 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-16 21:06:14,766 INFO L854 garLoopResultBuilder]: At program point L10129(line 10129) the Hoare annotation is: false [2021-11-16 21:06:14,766 INFO L858 garLoopResultBuilder]: For program point L10129-1(line 10129) no Hoare annotation was computed. [2021-11-16 21:06:14,767 INFO L854 garLoopResultBuilder]: At program point L7198(line 7198) the Hoare annotation is: false [2021-11-16 21:06:14,767 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2021-11-16 21:06:14,767 INFO L858 garLoopResultBuilder]: For program point L7198-1(line 7198) no Hoare annotation was computed. [2021-11-16 21:06:14,767 INFO L858 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2021-11-16 21:06:14,767 INFO L858 garLoopResultBuilder]: For program point L10130(line 10130) no Hoare annotation was computed. [2021-11-16 21:06:14,767 INFO L854 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: false [2021-11-16 21:06:14,767 INFO L854 garLoopResultBuilder]: At program point L10130-2(line 10130) the Hoare annotation is: false [2021-11-16 21:06:14,767 INFO L858 garLoopResultBuilder]: For program point L10130-3(line 10130) no Hoare annotation was computed. [2021-11-16 21:06:14,767 INFO L858 garLoopResultBuilder]: For program point L7277-1(line 7277) no Hoare annotation was computed. [2021-11-16 21:06:14,768 INFO L854 garLoopResultBuilder]: At program point L7277(line 7277) the Hoare annotation is: false [2021-11-16 21:06:14,768 INFO L854 garLoopResultBuilder]: At program point L10118-1(line 10118) the Hoare annotation is: false [2021-11-16 21:06:14,768 INFO L858 garLoopResultBuilder]: For program point L10118-2(line 10118) no Hoare annotation was computed. [2021-11-16 21:06:14,768 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10134) no Hoare annotation was computed. [2021-11-16 21:06:14,768 INFO L854 garLoopResultBuilder]: At program point L10122-1(line 10122) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_hash_iter_next_harness_~#map~0#1.base|) (< 1 |ULTIMATE.start_aws_hash_iter_next_harness_~#iter~2#1.base|) (= |ULTIMATE.start_aws_hash_iter_next_harness_#t~ret1328#1| 0) (< 0 |#StackHeapBarrier|)) [2021-11-16 21:06:14,768 INFO L858 garLoopResultBuilder]: For program point L10122-2(line 10122) no Hoare annotation was computed. [2021-11-16 21:06:14,769 INFO L854 garLoopResultBuilder]: At program point L10118(line 10118) the Hoare annotation is: false [2021-11-16 21:06:14,769 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 21:06:14,769 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 21:06:14,769 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 21:06:14,769 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:06:14,769 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 21:06:14,769 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 21:06:14,771 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:06:14,772 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:06:14,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:14,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:14,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:14,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:06:14 BoogieIcfgContainer [2021-11-16 21:06:14,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:06:14,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:06:14,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:06:14,807 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:06:14,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:04:52" (3/4) ... [2021-11-16 21:06:14,809 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_get_next_element [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_next [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 21:06:14,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_is_valid [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 21:06:14,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2021-11-16 21:06:14,829 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 156 nodes and edges [2021-11-16 21:06:14,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2021-11-16 21:06:14,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-16 21:06:14,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-16 21:06:14,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 21:06:14,834 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 21:06:14,834 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 21:06:14,835 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 21:06:14,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || ((((\exists v___CPROVER_overflow_mult_~#c~1.base_88 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88 := 0] == \valid) && tl_last_error == \old(tl_last_error)) && \old(a) * \old(b) == unknown-#memory_int-unknown[r][r]) && \result == 0) [2021-11-16 21:06:14,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v___CPROVER_overflow_mult_~#c~1.base_88 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88 := 0] == \valid)) && \result == 0) && tl_last_error == \old(tl_last_error)) [2021-11-16 21:06:15,381 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 21:06:15,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:06:15,381 INFO L158 Benchmark]: Toolchain (without parser) took 89059.20ms. Allocated memory was 88.1MB in the beginning and 408.9MB in the end (delta: 320.9MB). Free memory was 48.7MB in the beginning and 239.2MB in the end (delta: -190.5MB). Peak memory consumption was 296.9MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,382 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:06:15,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2539.21ms. Allocated memory was 88.1MB in the beginning and 161.5MB in the end (delta: 73.4MB). Free memory was 48.5MB in the beginning and 80.1MB in the end (delta: -31.6MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.73ms. Allocated memory is still 161.5MB. Free memory was 80.1MB in the beginning and 69.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,382 INFO L158 Benchmark]: Boogie Preprocessor took 68.75ms. Allocated memory is still 161.5MB. Free memory was 69.7MB in the beginning and 63.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,382 INFO L158 Benchmark]: RCFGBuilder took 3062.69ms. Allocated memory is still 161.5MB. Free memory was 63.4MB in the beginning and 56.7MB in the end (delta: 6.7MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,382 INFO L158 Benchmark]: TraceAbstraction took 82642.05ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 55.8MB in the beginning and 205.8MB in the end (delta: -150.0MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,383 INFO L158 Benchmark]: Witness Printer took 574.77ms. Allocated memory is still 408.9MB. Free memory was 205.8MB in the beginning and 239.2MB in the end (delta: -33.4MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2021-11-16 21:06:15,383 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2539.21ms. Allocated memory was 88.1MB in the beginning and 161.5MB in the end (delta: 73.4MB). Free memory was 48.5MB in the beginning and 80.1MB in the end (delta: -31.6MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.73ms. Allocated memory is still 161.5MB. Free memory was 80.1MB in the beginning and 69.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.75ms. Allocated memory is still 161.5MB. Free memory was 69.7MB in the beginning and 63.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3062.69ms. Allocated memory is still 161.5MB. Free memory was 63.4MB in the beginning and 56.7MB in the end (delta: 6.7MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 82642.05ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 55.8MB in the beginning and 205.8MB in the end (delta: -150.0MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. * Witness Printer took 574.77ms. Allocated memory is still 408.9MB. Free memory was 205.8MB in the beginning and 239.2MB in the end (delta: -33.4MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 82.5s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1604 mSDsluCounter, 24052 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3121 IncrementalHoareTripleChecker+Unchecked, 19876 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4661 IncrementalHoareTripleChecker+Invalid, 8424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 4176 mSDtfsCounter, 4661 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6282 GetRequests, 5855 SyntacticMatches, 28 SemanticMatches, 399 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=21, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 62 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 64 LocationsWithAnnotation, 1297 PreInvPairs, 1353 NumberOfFragments, 879 HoareAnnotationTreeSize, 1297 FomulaSimplifications, 532 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 64 FomulaSimplificationsInter, 800 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 28.6s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 6561 NumberOfCodeBlocks, 6561 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 7149 ConstructedInterpolants, 213 QuantifiedInterpolants, 18203 SizeOfPredicates, 146 NumberOfNonLiveVariables, 58345 ConjunctsInSsa, 940 ConjunctsInUnsatCore, 36 InterpolantComputations, 18 PerfectInterpolantSequences, 8997/9540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9796]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-16 21:06:15,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,390 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:15,390 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:15,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,391 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:15,391 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] Derived loop invariant: (((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || ((((\exists v___CPROVER_overflow_mult_~#c~1.base_88 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88 := 0] == \valid) && tl_last_error == \old(tl_last_error)) && \old(a) * \old(b) == unknown-#memory_int-unknown[r][r]) && \result == 0) - InvariantResult [Line: 2541]: Loop Invariant [2021-11-16 21:06:15,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:15,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:15,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-16 21:06:15,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-16 21:06:15,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] [2021-11-16 21:06:15,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_88,QUANTIFIED] Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v___CPROVER_overflow_mult_~#c~1.base_88 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_88 := 0] == \valid)) && \result == 0) && tl_last_error == \old(tl_last_error)) RESULT: Ultimate proved your program to be correct! [2021-11-16 21:06:15,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE