./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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_byte_buf_secure_zero_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 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:33:14,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:33:14,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:33:14,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:33:14,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:33:14,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:33:14,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:33:14,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:33:14,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:33:14,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:33:14,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:33:14,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:33:14,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:33:14,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:33:14,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:33:14,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:33:14,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:33:14,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:33:14,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:33:14,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:33:14,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:33:14,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:33:14,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:33:14,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:33:14,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:33:14,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:33:14,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:33:14,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:33:14,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:33:14,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:33:14,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:33:14,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:33:14,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:33:14,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:33:14,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:33:14,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:33:14,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:33:14,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:33:14,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:33:14,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:33:14,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:33:14,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:33:14,446 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:33:14,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:33:14,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:33:14,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:33:14,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:33:14,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:33:14,448 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:33:14,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:33:14,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:33:14,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:33:14,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:33:14,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:33:14,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:33:14,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:33:14,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:33:14,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:33:14,450 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 -> 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 [2021-11-22 19:33:14,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:33:14,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:33:14,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:33:14,680 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:33:14,680 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:33:14,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-22 19:33:14,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bc63953/050dd7e51737412ab294ee3323c8565e/FLAG4f01ebbef [2021-11-22 19:33:15,311 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:33:15,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-22 19:33:15,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bc63953/050dd7e51737412ab294ee3323c8565e/FLAG4f01ebbef [2021-11-22 19:33:15,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bc63953/050dd7e51737412ab294ee3323c8565e [2021-11-22 19:33:15,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:33:15,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:33:15,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:33:15,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:33:15,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:33:15,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:33:15" (1/1) ... [2021-11-22 19:33:15,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1102b706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:15, skipping insertion in model container [2021-11-22 19:33:15,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:33:15" (1/1) ... [2021-11-22 19:33:15,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:33:15,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:33:15,987 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_byte_buf_secure_zero_harness.i[4498,4511] [2021-11-22 19:33:15,992 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_byte_buf_secure_zero_harness.i[4558,4571] [2021-11-22 19:33:16,462 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,476 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,476 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,477 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,478 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,486 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,489 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,490 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,490 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,712 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:33:16,714 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:33:16,715 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:33:16,716 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:33:16,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:33:16,721 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:33:16,722 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:33:16,723 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:33:16,725 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:33:16,726 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:33:16,811 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:33:16,906 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,907 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:16,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:33:17,039 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:33:17,067 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_byte_buf_secure_zero_harness.i[4498,4511] [2021-11-22 19:33:17,068 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_byte_buf_secure_zero_harness.i[4558,4571] [2021-11-22 19:33:17,095 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,096 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,096 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,097 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,098 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,103 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,103 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,104 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,104 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,133 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:33:17,133 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:33:17,134 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:33:17,134 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:33:17,135 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:33:17,135 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:33:17,136 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:33:17,136 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:33:17,136 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:33:17,140 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:33:17,155 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:33:17,196 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,196 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:33:17,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:33:17,371 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:33:17,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17 WrapperNode [2021-11-22 19:33:17,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:33:17,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:33:17,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:33:17,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:33:17,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,534 INFO L137 Inliner]: procedures = 691, calls = 2614, calls flagged for inlining = 951, calls inlined = 29, statements flattened = 1056 [2021-11-22 19:33:17,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:33:17,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:33:17,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:33:17,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:33:17,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:33:17,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:33:17,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:33:17,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:33:17,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (1/1) ... [2021-11-22 19:33:17,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:33:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:17,626 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-22 19:33:17,645 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-22 19:33:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:33:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:33:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:33:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:33:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:33:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:33:17,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:33:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:33:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:33:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:33:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:33:17,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:33:17,907 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:33:17,908 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:33:18,634 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:33:18,640 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:33:18,640 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 19:33:18,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:33:18 BoogieIcfgContainer [2021-11-22 19:33:18,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:33:18,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:33:18,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:33:18,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:33:18,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:33:15" (1/3) ... [2021-11-22 19:33:18,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fde97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:33:18, skipping insertion in model container [2021-11-22 19:33:18,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:33:17" (2/3) ... [2021-11-22 19:33:18,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fde97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:33:18, skipping insertion in model container [2021-11-22 19:33:18,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:33:18" (3/3) ... [2021-11-22 19:33:18,647 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_secure_zero_harness.i [2021-11-22 19:33:18,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:33:18,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-22 19:33:18,685 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:33:18,690 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-22 19:33:18,690 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-22 19:33:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 114 states have internal predecessors, (158), 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-22 19:33:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-22 19:33:18,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:18,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-22 19:33:18,706 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 758852543, now seen corresponding path program 1 times [2021-11-22 19:33:18,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:18,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597827583] [2021-11-22 19:33:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:18,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:19,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597827583] [2021-11-22 19:33:19,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597827583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:19,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:19,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:33:19,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528512010] [2021-11-22 19:33:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:19,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:33:19,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:33:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:33:19,168 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 114 states have internal predecessors, (158), 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) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-22 19:33:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:19,203 INFO L93 Difference]: Finished difference Result 226 states and 311 transitions. [2021-11-22 19:33:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:33:19,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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) Word has length 29 [2021-11-22 19:33:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:19,216 INFO L225 Difference]: With dead ends: 226 [2021-11-22 19:33:19,216 INFO L226 Difference]: Without dead ends: 110 [2021-11-22 19:33:19,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:33:19,225 INFO L933 BasicCegarLoop]: 147 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, 147 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-22 19:33:19,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-22 19:33:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-22 19:33:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 109 states have internal predecessors, (142), 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-22 19:33:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2021-11-22 19:33:19,263 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 29 [2021-11-22 19:33:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:19,265 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2021-11-22 19:33:19,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-22 19:33:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2021-11-22 19:33:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-22 19:33:19,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:19,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-22 19:33:19,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:33:19,271 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash 912535103, now seen corresponding path program 1 times [2021-11-22 19:33:19,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:19,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158355127] [2021-11-22 19:33:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:19,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:19,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:19,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158355127] [2021-11-22 19:33:19,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158355127] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:19,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:19,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:19,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580736707] [2021-11-22 19:33:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:19,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:19,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:19,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:19,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:19,443 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-22 19:33:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:19,501 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2021-11-22 19:33:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:33:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) Word has length 29 [2021-11-22 19:33:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:19,503 INFO L225 Difference]: With dead ends: 194 [2021-11-22 19:33:19,503 INFO L226 Difference]: Without dead ends: 110 [2021-11-22 19:33:19,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:19,504 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 199 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:19,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 182 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-22 19:33:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-22 19:33:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 109 states have internal predecessors, (139), 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-22 19:33:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2021-11-22 19:33:19,510 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 139 transitions. Word has length 29 [2021-11-22 19:33:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:19,510 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 139 transitions. [2021-11-22 19:33:19,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-22 19:33:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 139 transitions. [2021-11-22 19:33:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-22 19:33:19,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:19,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:19,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:33:19,511 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1975183453, now seen corresponding path program 1 times [2021-11-22 19:33:19,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065634456] [2021-11-22 19:33:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:19,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:19,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065634456] [2021-11-22 19:33:19,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065634456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:19,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:19,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:33:19,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199598795] [2021-11-22 19:33:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:19,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:33:19,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:33:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:33:19,643 INFO L87 Difference]: Start difference. First operand 110 states and 139 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-22 19:33:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:19,705 INFO L93 Difference]: Finished difference Result 235 states and 302 transitions. [2021-11-22 19:33:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:19,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) Word has length 41 [2021-11-22 19:33:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:19,706 INFO L225 Difference]: With dead ends: 235 [2021-11-22 19:33:19,706 INFO L226 Difference]: Without dead ends: 150 [2021-11-22 19:33:19,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:19,708 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 89 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:19,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 366 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-22 19:33:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 118. [2021-11-22 19:33:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 117 states have internal predecessors, (147), 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-22 19:33:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2021-11-22 19:33:19,714 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 41 [2021-11-22 19:33:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:19,714 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2021-11-22 19:33:19,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-22 19:33:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2021-11-22 19:33:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-22 19:33:19,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:19,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:19,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:33:19,716 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1913143839, now seen corresponding path program 1 times [2021-11-22 19:33:19,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:19,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967470359] [2021-11-22 19:33:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:19,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:19,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:19,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967470359] [2021-11-22 19:33:19,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967470359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:19,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:19,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:19,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977247412] [2021-11-22 19:33:19,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:19,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:19,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:19,869 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-22 19:33:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:19,921 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2021-11-22 19:33:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:33:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) Word has length 41 [2021-11-22 19:33:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:19,923 INFO L225 Difference]: With dead ends: 159 [2021-11-22 19:33:19,923 INFO L226 Difference]: Without dead ends: 118 [2021-11-22 19:33:19,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:19,926 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 277 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:19,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 208 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-22 19:33:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-22 19:33:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.280701754385965) internal successors, (146), 117 states have internal predecessors, (146), 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-22 19:33:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2021-11-22 19:33:19,943 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 41 [2021-11-22 19:33:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:19,943 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2021-11-22 19:33:19,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-22 19:33:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2021-11-22 19:33:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-22 19:33:19,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:19,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:19,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:33:19,947 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 625908820, now seen corresponding path program 1 times [2021-11-22 19:33:19,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:19,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980444476] [2021-11-22 19:33:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:19,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:20,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:20,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980444476] [2021-11-22 19:33:20,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980444476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:20,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:20,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:20,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108446010] [2021-11-22 19:33:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:20,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:20,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:20,143 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-22 19:33:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:20,245 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2021-11-22 19:33:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:20,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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) Word has length 47 [2021-11-22 19:33:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:20,247 INFO L225 Difference]: With dead ends: 189 [2021-11-22 19:33:20,247 INFO L226 Difference]: Without dead ends: 185 [2021-11-22 19:33:20,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:20,247 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 154 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:20,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 516 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-22 19:33:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 126. [2021-11-22 19:33:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 125 states have internal predecessors, (154), 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-22 19:33:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-11-22 19:33:20,251 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 47 [2021-11-22 19:33:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:20,251 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-11-22 19:33:20,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-22 19:33:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-11-22 19:33:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 19:33:20,252 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:20,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:20,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:33:20,253 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2063749196, now seen corresponding path program 1 times [2021-11-22 19:33:20,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:20,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914537630] [2021-11-22 19:33:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:20,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:20,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914537630] [2021-11-22 19:33:20,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914537630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:20,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:20,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:20,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653519994] [2021-11-22 19:33:20,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:20,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:20,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:20,444 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-22 19:33:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:20,579 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2021-11-22 19:33:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:33:20,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) Word has length 51 [2021-11-22 19:33:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:20,580 INFO L225 Difference]: With dead ends: 180 [2021-11-22 19:33:20,580 INFO L226 Difference]: Without dead ends: 133 [2021-11-22 19:33:20,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:20,581 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 42 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:20,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 419 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-22 19:33:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2021-11-22 19:33:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 127 states have internal predecessors, (156), 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-22 19:33:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2021-11-22 19:33:20,584 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 51 [2021-11-22 19:33:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:20,584 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2021-11-22 19:33:20,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-22 19:33:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2021-11-22 19:33:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 19:33:20,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:20,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:20,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:33:20,585 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:20,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1551159730, now seen corresponding path program 1 times [2021-11-22 19:33:20,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:20,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931888569] [2021-11-22 19:33:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:20,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:20,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:20,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931888569] [2021-11-22 19:33:20,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931888569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:20,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:20,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:20,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708814263] [2021-11-22 19:33:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:20,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:20,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:20,927 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-22 19:33:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:21,199 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2021-11-22 19:33:21,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 19:33:21,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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) Word has length 51 [2021-11-22 19:33:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:21,200 INFO L225 Difference]: With dead ends: 253 [2021-11-22 19:33:21,201 INFO L226 Difference]: Without dead ends: 152 [2021-11-22 19:33:21,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:21,202 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 455 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:21,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 451 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-22 19:33:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2021-11-22 19:33:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.25) internal successors, (150), 123 states have internal predecessors, (150), 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-22 19:33:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2021-11-22 19:33:21,207 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 51 [2021-11-22 19:33:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:21,208 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2021-11-22 19:33:21,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-22 19:33:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2021-11-22 19:33:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 19:33:21,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:21,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:21,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:33:21,210 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash 417039884, now seen corresponding path program 1 times [2021-11-22 19:33:21,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:21,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604882476] [2021-11-22 19:33:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:21,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:21,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604882476] [2021-11-22 19:33:21,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604882476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:21,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:21,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:21,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61579393] [2021-11-22 19:33:21,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:21,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:21,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:21,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:21,498 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-22 19:33:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:22,010 INFO L93 Difference]: Finished difference Result 367 states and 452 transitions. [2021-11-22 19:33:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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) Word has length 59 [2021-11-22 19:33:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:22,011 INFO L225 Difference]: With dead ends: 367 [2021-11-22 19:33:22,011 INFO L226 Difference]: Without dead ends: 260 [2021-11-22 19:33:22,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:33:22,012 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 572 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:22,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 906 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-22 19:33:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 147. [2021-11-22 19:33:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 146 states have internal predecessors, (177), 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-22 19:33:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 177 transitions. [2021-11-22 19:33:22,016 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 177 transitions. Word has length 59 [2021-11-22 19:33:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:22,017 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 177 transitions. [2021-11-22 19:33:22,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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-22 19:33:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2021-11-22 19:33:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 19:33:22,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:22,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:22,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:33:22,018 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:22,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1803243278, now seen corresponding path program 1 times [2021-11-22 19:33:22,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:22,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129909158] [2021-11-22 19:33:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:22,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:22,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129909158] [2021-11-22 19:33:22,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129909158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:22,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:22,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:22,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944183664] [2021-11-22 19:33:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:22,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:22,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:22,202 INFO L87 Difference]: Start difference. First operand 147 states and 177 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-22 19:33:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:22,315 INFO L93 Difference]: Finished difference Result 296 states and 347 transitions. [2021-11-22 19:33:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:33:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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) Word has length 59 [2021-11-22 19:33:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:22,316 INFO L225 Difference]: With dead ends: 296 [2021-11-22 19:33:22,316 INFO L226 Difference]: Without dead ends: 177 [2021-11-22 19:33:22,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:22,318 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 65 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:22,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 741 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-22 19:33:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 147. [2021-11-22 19:33:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 146 states have internal predecessors, (174), 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-22 19:33:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2021-11-22 19:33:22,322 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 59 [2021-11-22 19:33:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:22,322 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2021-11-22 19:33:22,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-22 19:33:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2021-11-22 19:33:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 19:33:22,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:22,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:22,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:33:22,324 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1447251248, now seen corresponding path program 1 times [2021-11-22 19:33:22,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443004344] [2021-11-22 19:33:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:22,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:22,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:22,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443004344] [2021-11-22 19:33:22,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443004344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:22,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:22,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:22,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505281367] [2021-11-22 19:33:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:22,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:22,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:22,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:22,532 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-22 19:33:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:23,149 INFO L93 Difference]: Finished difference Result 370 states and 434 transitions. [2021-11-22 19:33:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:33:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2021-11-22 19:33:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:23,152 INFO L225 Difference]: With dead ends: 370 [2021-11-22 19:33:23,152 INFO L226 Difference]: Without dead ends: 232 [2021-11-22 19:33:23,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:33:23,152 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 344 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:23,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 552 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:33:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-22 19:33:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 140. [2021-11-22 19:33:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.1764705882352942) internal successors, (160), 139 states have internal predecessors, (160), 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-22 19:33:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2021-11-22 19:33:23,158 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 63 [2021-11-22 19:33:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:23,158 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2021-11-22 19:33:23,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-22 19:33:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2021-11-22 19:33:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 19:33:23,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:23,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:23,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:33:23,159 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1193510672, now seen corresponding path program 1 times [2021-11-22 19:33:23,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:23,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940199819] [2021-11-22 19:33:23,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:23,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:23,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940199819] [2021-11-22 19:33:23,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940199819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:23,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:23,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:23,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445237314] [2021-11-22 19:33:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:23,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:23,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:23,270 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-22 19:33:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:23,430 INFO L93 Difference]: Finished difference Result 306 states and 346 transitions. [2021-11-22 19:33:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:33:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) Word has length 63 [2021-11-22 19:33:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:23,431 INFO L225 Difference]: With dead ends: 306 [2021-11-22 19:33:23,431 INFO L226 Difference]: Without dead ends: 178 [2021-11-22 19:33:23,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:23,432 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 131 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:23,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 317 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-22 19:33:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2021-11-22 19:33:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 135 states have internal predecessors, (153), 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-22 19:33:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2021-11-22 19:33:23,436 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 63 [2021-11-22 19:33:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:23,436 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2021-11-22 19:33:23,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-22 19:33:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2021-11-22 19:33:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 19:33:23,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:23,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:23,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:33:23,436 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 893784432, now seen corresponding path program 1 times [2021-11-22 19:33:23,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:23,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088254826] [2021-11-22 19:33:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:23,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:23,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:23,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088254826] [2021-11-22 19:33:23,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088254826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:23,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:23,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:23,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14856022] [2021-11-22 19:33:23,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:23,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:23,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:23,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:23,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:23,642 INFO L87 Difference]: Start difference. First operand 136 states and 153 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-22 19:33:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:23,980 INFO L93 Difference]: Finished difference Result 359 states and 405 transitions. [2021-11-22 19:33:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:33:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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) Word has length 63 [2021-11-22 19:33:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:23,981 INFO L225 Difference]: With dead ends: 359 [2021-11-22 19:33:23,981 INFO L226 Difference]: Without dead ends: 263 [2021-11-22 19:33:23,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:33:23,982 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 827 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:23,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 474 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-11-22 19:33:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 211. [2021-11-22 19:33:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.1497584541062802) internal successors, (238), 210 states have internal predecessors, (238), 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-22 19:33:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 238 transitions. [2021-11-22 19:33:23,988 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 238 transitions. Word has length 63 [2021-11-22 19:33:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:23,988 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 238 transitions. [2021-11-22 19:33:23,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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-22 19:33:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 238 transitions. [2021-11-22 19:33:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 19:33:23,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:23,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:23,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:33:23,990 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 753235822, now seen corresponding path program 1 times [2021-11-22 19:33:23,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:23,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80239339] [2021-11-22 19:33:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:23,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:24,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:24,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80239339] [2021-11-22 19:33:24,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80239339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:24,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:24,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:24,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211969224] [2021-11-22 19:33:24,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:24,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:24,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:24,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:24,256 INFO L87 Difference]: Start difference. First operand 211 states and 238 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-22 19:33:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:24,362 INFO L93 Difference]: Finished difference Result 416 states and 472 transitions. [2021-11-22 19:33:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:24,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2021-11-22 19:33:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:24,364 INFO L225 Difference]: With dead ends: 416 [2021-11-22 19:33:24,364 INFO L226 Difference]: Without dead ends: 295 [2021-11-22 19:33:24,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:24,365 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 536 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:24,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [536 Valid, 386 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-22 19:33:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 211. [2021-11-22 19:33:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.1400966183574879) internal successors, (236), 210 states have internal predecessors, (236), 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-22 19:33:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2021-11-22 19:33:24,371 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 63 [2021-11-22 19:33:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:24,371 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2021-11-22 19:33:24,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-22 19:33:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2021-11-22 19:33:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 19:33:24,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:24,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:24,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:33:24,373 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash 632256714, now seen corresponding path program 1 times [2021-11-22 19:33:24,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:24,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502487071] [2021-11-22 19:33:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:24,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:24,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502487071] [2021-11-22 19:33:24,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502487071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:24,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:24,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:24,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369651235] [2021-11-22 19:33:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:24,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:24,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:24,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:24,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:24,740 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-22 19:33:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:24,979 INFO L93 Difference]: Finished difference Result 415 states and 468 transitions. [2021-11-22 19:33:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:33:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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) Word has length 70 [2021-11-22 19:33:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:24,981 INFO L225 Difference]: With dead ends: 415 [2021-11-22 19:33:24,981 INFO L226 Difference]: Without dead ends: 286 [2021-11-22 19:33:24,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:24,982 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 486 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:24,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 319 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-11-22 19:33:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 211. [2021-11-22 19:33:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.1304347826086956) internal successors, (234), 210 states have internal predecessors, (234), 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-22 19:33:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 234 transitions. [2021-11-22 19:33:24,989 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 234 transitions. Word has length 70 [2021-11-22 19:33:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:24,990 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 234 transitions. [2021-11-22 19:33:24,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-22 19:33:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 234 transitions. [2021-11-22 19:33:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 19:33:24,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:24,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:24,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:33:24,991 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1493718153, now seen corresponding path program 1 times [2021-11-22 19:33:24,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:24,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503364673] [2021-11-22 19:33:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:24,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:25,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:25,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503364673] [2021-11-22 19:33:25,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503364673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:25,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:25,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 19:33:25,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030622151] [2021-11-22 19:33:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:25,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 19:33:25,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:25,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 19:33:25,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 19:33:25,083 INFO L87 Difference]: Start difference. First operand 211 states and 234 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-22 19:33:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:25,093 INFO L93 Difference]: Finished difference Result 296 states and 330 transitions. [2021-11-22 19:33:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 19:33:25,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) Word has length 71 [2021-11-22 19:33:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:25,095 INFO L225 Difference]: With dead ends: 296 [2021-11-22 19:33:25,095 INFO L226 Difference]: Without dead ends: 167 [2021-11-22 19:33:25,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 19:33:25,096 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:25,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:33:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-22 19:33:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2021-11-22 19:33:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.12) internal successors, (168), 153 states have internal predecessors, (168), 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-22 19:33:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2021-11-22 19:33:25,101 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 71 [2021-11-22 19:33:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:25,102 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2021-11-22 19:33:25,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-22 19:33:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2021-11-22 19:33:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 19:33:25,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:25,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:25,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:33:25,103 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2014048011, now seen corresponding path program 1 times [2021-11-22 19:33:25,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952736254] [2021-11-22 19:33:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:25,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:25,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:25,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952736254] [2021-11-22 19:33:25,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952736254] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:33:25,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411715206] [2021-11-22 19:33:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:25,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:25,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:25,892 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-22 19:33:25,910 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-22 19:33:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:26,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 2583 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-22 19:33:26,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:33:26,469 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 19 treesize of output 15 [2021-11-22 19:33:26,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:33:26,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-11-22 19:33:26,912 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:33:26,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-22 19:33:26,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-11-22 19:33:27,018 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 44 treesize of output 28 [2021-11-22 19:33:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:27,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:33:27,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616))) is different from false [2021-11-22 19:33:27,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616))) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) is different from false [2021-11-22 19:33:27,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616)) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) is different from false [2021-11-22 19:33:27,431 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616)) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|) is different from false [2021-11-22 19:33:27,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:33:27,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2021-11-22 19:33:27,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2021-11-22 19:33:27,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:33:27,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-11-22 19:33:27,512 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:33:27,513 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 51 treesize of output 55 [2021-11-22 19:33:27,654 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 41 treesize of output 35 [2021-11-22 19:33:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:33:27,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411715206] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:33:27,792 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:33:27,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2021-11-22 19:33:27,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537816525] [2021-11-22 19:33:27,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:33:27,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-22 19:33:27,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:27,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-22 19:33:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1024, Unknown=4, NotChecked=268, Total=1406 [2021-11-22 19:33:27,794 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 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-22 19:33:28,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (let ((.cse8 (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse6 (= (mod (select .cse5 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse2 (not .cse6)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) (.cse7 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|)) (.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse8)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|))) (and (< (+ |c_ULTIMATE.start_bounded_malloc_#res#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) .cse2 (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) 8) 0) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (not (= (select .cse3 8) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse4 (select .cse5 16))) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (or (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616)) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| 0) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (or (and .cse6 |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|) (and .cse2 .cse7)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) .cse8) .cse9) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) .cse7 (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= .cse9 (+ (* 18446744073709551616 (div (+ (- 1) .cse9) 18446744073709551616)) 18446744073709551615)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) 1) (< (+ (select .cse3 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0))))) is different from false [2021-11-22 19:33:28,306 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616)) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) (not (= (mod (select .cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse3 (select .cse2 16))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0))) is different from false [2021-11-22 19:33:28,312 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse5 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse0 (select .cse4 .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse5))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int)) (|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616)) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse0)) (not (= (mod (select .cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_#t~mem706#1.offset| .cse2) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse3 (select .cse1 16))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (= .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_#t~mem706#1.base|) (< (+ (select .cse4 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= .cse2 0)))) is different from false [2021-11-22 19:33:28,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= (mod (select .cse0 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| Int)) (or (forall ((v_ArrVal_497 Int) (v_ArrVal_495 (Array Int Int))) (< 0 (mod (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4| v_ArrVal_495) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_497) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616))) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_4|))) (< (+ |c_ULTIMATE.start_memset_impl_~s#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (or (not (= |c_ULTIMATE.start_memset_impl_~s#1.base| 0)) (not (= |c_ULTIMATE.start_memset_impl_~s#1.offset| 0)) (= |c_ULTIMATE.start_memset_impl_~n#1| (* 18446744073709551616 (div |c_ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse1 (select .cse0 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= |c_ULTIMATE.start_memset_impl_~s#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)))) is different from false [2021-11-22 19:33:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:28,504 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2021-11-22 19:33:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-22 19:33:28,505 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 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) Word has length 73 [2021-11-22 19:33:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:28,506 INFO L225 Difference]: With dead ends: 260 [2021-11-22 19:33:28,506 INFO L226 Difference]: Without dead ends: 193 [2021-11-22 19:33:28,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=334, Invalid=1760, Unknown=8, NotChecked=760, Total=2862 [2021-11-22 19:33:28,507 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 266 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:28,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 1509 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 409 Invalid, 0 Unknown, 362 Unchecked, 0.3s Time] [2021-11-22 19:33:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-22 19:33:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2021-11-22 19:33:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.1079545454545454) internal successors, (195), 179 states have internal predecessors, (195), 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-22 19:33:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2021-11-22 19:33:28,536 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 73 [2021-11-22 19:33:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:28,536 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2021-11-22 19:33:28,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 states have internal predecessors, (193), 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-22 19:33:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2021-11-22 19:33:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 19:33:28,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:28,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:28,569 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-22 19:33:28,751 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,SelfDestructingSolverStorable15 [2021-11-22 19:33:28,751 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1319713483, now seen corresponding path program 1 times [2021-11-22 19:33:28,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:28,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749266426] [2021-11-22 19:33:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:28,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:29,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:29,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749266426] [2021-11-22 19:33:29,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749266426] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:33:29,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753509424] [2021-11-22 19:33:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:29,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:29,676 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-22 19:33:29,715 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-22 19:33:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:30,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 2593 conjuncts, 72 conjunts are in the unsatisfiable core [2021-11-22 19:33:30,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:33:30,227 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 19 treesize of output 15 [2021-11-22 19:33:30,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:33:30,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-11-22 19:33:30,649 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:33:30,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-22 19:33:30,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-11-22 19:33:30,758 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 44 treesize of output 28 [2021-11-22 19:33:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:30,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:33:30,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2021-11-22 19:33:30,901 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int)) (or (forall ((v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 (- 1)) 18446744073709551616)))))) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|))) is different from false [2021-11-22 19:33:30,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 (- 1)) 18446744073709551616))))))) is different from false [2021-11-22 19:33:31,115 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse0 (- 1)) 18446744073709551616))))))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|) is different from false [2021-11-22 19:33:31,130 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:33:31,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 86 [2021-11-22 19:33:31,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2021-11-22 19:33:31,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-11-22 19:33:31,184 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:33:31,184 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 68 treesize of output 68 [2021-11-22 19:33:31,347 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 41 treesize of output 35 [2021-11-22 19:33:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:33:31,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753509424] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:33:31,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:33:31,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 39 [2021-11-22 19:33:31,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783628534] [2021-11-22 19:33:31,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:33:31,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-22 19:33:31,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-22 19:33:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1085, Unknown=4, NotChecked=276, Total=1482 [2021-11-22 19:33:31,474 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand has 39 states, 39 states have (on average 4.9743589743589745) internal successors, (194), 39 states have internal predecessors, (194), 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-22 19:33:32,035 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (let ((.cse7 (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse8 (= (mod (select .cse6 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse2 (not .cse8)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) (.cse9 (not |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse7)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|))) (and (< (+ |c_ULTIMATE.start_bounded_malloc_#res#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) .cse2 (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) 8) 0) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (not (= (select .cse3 8) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base| |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (or (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (let ((.cse4 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse4 (- 1)) 18446744073709551616))))))) |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|) (= .cse5 (select .cse6 .cse7)) (= |c_ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| 0) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (or (and .cse8 |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1|) (and .cse2 .cse9)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) .cse9 (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= .cse5 (+ (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616)) 18446744073709551615)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) 1) (< (+ (select .cse3 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= |c_ULTIMATE.start_bounded_malloc_#res#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|)) (= |c_ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))))) is different from false [2021-11-22 19:33:32,039 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 16 |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse4))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) (not (= (mod (select .cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= .cse3 (select .cse2 .cse4)) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (let ((.cse5 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse5 (- 1)) 18446744073709551616))))))) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0) (= |c_ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= .cse3 (+ (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)) 18446744073709551615))))) is different from false [2021-11-22 19:33:32,044 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (select .cse0 .cse1))) (not (= (mod (select .cse2 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse3 (select .cse2 16))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (let ((.cse4 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse4 (- 1)) 18446744073709551616))))))) (< (+ (select .cse0 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse1) 0))) is different from false [2021-11-22 19:33:32,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (.cse0 (select .cse5 .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) .cse6))) (and (not (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| .cse0)) (not (= (mod (select .cse1 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_#t~mem706#1.offset| .cse2) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse3 (select .cse1 16))) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int) (v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|) (let ((.cse4 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse4 (- 1)) 18446744073709551616))))))) (= .cse0 |c_ULTIMATE.start_aws_byte_buf_secure_zero_#t~mem706#1.base|) (< (+ (select .cse5 8) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (= .cse2 0)))) is different from false [2021-11-22 19:33:32,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|))) (and (not (= (mod (select .cse0 (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)) (< (+ |c_ULTIMATE.start_memset_impl_~s#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (or (not (= |c_ULTIMATE.start_memset_impl_~s#1.base| 0)) (not (= |c_ULTIMATE.start_memset_impl_~s#1.offset| 0)) (= |c_ULTIMATE.start_memset_impl_~n#1| (* 18446744073709551616 (div |c_ULTIMATE.start_memset_impl_~n#1| 18446744073709551616)))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (let ((.cse1 (select .cse0 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (not (= |c_ULTIMATE.start_memset_impl_~s#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|)) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| Int)) (or (forall ((v_ArrVal_574 Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse2 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6| v_ArrVal_572) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_574) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse2 (- 1)) 18446744073709551616)))))) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_6|))))) is different from false [2021-11-22 19:33:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:32,592 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2021-11-22 19:33:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:33:32,592 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.9743589743589745) internal successors, (194), 39 states have internal predecessors, (194), 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) Word has length 73 [2021-11-22 19:33:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:32,593 INFO L225 Difference]: With dead ends: 302 [2021-11-22 19:33:32,593 INFO L226 Difference]: Without dead ends: 235 [2021-11-22 19:33:32,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=368, Invalid=2011, Unknown=9, NotChecked=918, Total=3306 [2021-11-22 19:33:32,595 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 382 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:32,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 3304 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 894 Invalid, 0 Unknown, 617 Unchecked, 0.5s Time] [2021-11-22 19:33:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-22 19:33:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 141. [2021-11-22 19:33:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.102189781021898) internal successors, (151), 140 states have internal predecessors, (151), 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-22 19:33:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2021-11-22 19:33:32,599 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 73 [2021-11-22 19:33:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:32,600 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2021-11-22 19:33:32,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.9743589743589745) internal successors, (194), 39 states have internal predecessors, (194), 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-22 19:33:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2021-11-22 19:33:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 19:33:32,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:32,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:32,620 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-22 19:33:32,811 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,SelfDestructingSolverStorable16 [2021-11-22 19:33:32,812 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash -86046614, now seen corresponding path program 1 times [2021-11-22 19:33:32,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:32,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259872842] [2021-11-22 19:33:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:32,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:33:32,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:32,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259872842] [2021-11-22 19:33:32,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259872842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:32,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:32,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:32,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125370946] [2021-11-22 19:33:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:32,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:32,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:32,967 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-22 19:33:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:33,179 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2021-11-22 19:33:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 19:33:33,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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) Word has length 75 [2021-11-22 19:33:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:33,180 INFO L225 Difference]: With dead ends: 184 [2021-11-22 19:33:33,180 INFO L226 Difference]: Without dead ends: 180 [2021-11-22 19:33:33,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:33:33,182 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 134 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:33,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 557 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-22 19:33:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 141. [2021-11-22 19:33:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 138 states have (on average 1.0942028985507246) internal successors, (151), 140 states have internal predecessors, (151), 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-22 19:33:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2021-11-22 19:33:33,207 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 75 [2021-11-22 19:33:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:33,208 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2021-11-22 19:33:33,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-22 19:33:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2021-11-22 19:33:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:33:33,211 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:33,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:33,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:33:33,211 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1130380620, now seen corresponding path program 1 times [2021-11-22 19:33:33,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:33,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462208667] [2021-11-22 19:33:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:33,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:33,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462208667] [2021-11-22 19:33:33,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462208667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:33:33,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178903280] [2021-11-22 19:33:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:33,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:33,863 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-22 19:33:33,864 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-22 19:33:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:34,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 2629 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-22 19:33:34,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:33:34,374 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 19 treesize of output 15 [2021-11-22 19:33:34,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:33:34,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-11-22 19:33:34,882 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:33:34,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-22 19:33:34,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-11-22 19:33:35,063 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 45 treesize of output 29 [2021-11-22 19:33:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:35,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:33:35,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_memset_impl_~sp~0#1.base| v_ArrVal_685))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_686))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2021-11-22 19:33:35,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int)) (or (forall ((v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_686))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|))) is different from false [2021-11-22 19:33:35,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int) (v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (or (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_686))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|))) is different from false [2021-11-22 19:33:35,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int) (v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| v_ArrVal_686) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) is different from false [2021-11-22 19:33:35,649 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_aws_byte_buf_is_valid_#t~short676#1| (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int) (v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| v_ArrVal_686) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))))) is different from false [2021-11-22 19:33:35,663 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:33:35,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 86 [2021-11-22 19:33:35,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2021-11-22 19:33:35,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 19:33:35,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-22 19:33:35,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:33:35,719 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 67 treesize of output 67 [2021-11-22 19:33:35,823 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 41 treesize of output 35 [2021-11-22 19:33:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 19:33:35,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178903280] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 19:33:35,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 19:33:35,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2021-11-22 19:33:35,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639493123] [2021-11-22 19:33:35,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 19:33:35,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-22 19:33:35,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:35,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-22 19:33:35,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=982, Unknown=5, NotChecked=340, Total=1482 [2021-11-22 19:33:35,933 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 39 states, 39 states have (on average 5.641025641025641) internal successors, (220), 39 states have internal predecessors, (220), 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-22 19:33:36,222 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) 8) 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| 0) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int) (v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|) (let ((.cse0 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| v_ArrVal_686) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 18446744073709551616) 0)) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|)) is different from false [2021-11-22 19:33:36,228 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 18446744073709551616) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 0) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int) (v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (or (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_686))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|)))) is different from false [2021-11-22 19:33:36,239 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_#t~mem706#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 18446744073709551616) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) 0) (< (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int) (v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (or (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_686))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|)) |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|)))) is different from false [2021-11-22 19:33:36,242 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_memset_impl_~s#1.base| 1) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (forall ((|v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| Int)) (or (forall ((v_ArrVal_686 Int) (v_ArrVal_685 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8| v_ArrVal_685))) (store .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| (store (select .cse1 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| v_ArrVal_686))) |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) (< |c_ULTIMATE.start_memset_impl_~s#1.base| |v_ULTIMATE.start_memset_impl_~sp~0#1.base_8|))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset| 0) (= |c_ULTIMATE.start_memset_impl_~s#1.offset| 0) (= |c_ULTIMATE.start_memset_impl_~n#1| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.offset|))) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset| 0) (= |c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf#1.base| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (not (= (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) is different from false [2021-11-22 19:33:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:36,585 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2021-11-22 19:33:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:33:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.641025641025641) internal successors, (220), 39 states have internal predecessors, (220), 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) Word has length 91 [2021-11-22 19:33:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:36,587 INFO L225 Difference]: With dead ends: 260 [2021-11-22 19:33:36,587 INFO L226 Difference]: Without dead ends: 226 [2021-11-22 19:33:36,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=1485, Unknown=9, NotChecked=792, Total=2550 [2021-11-22 19:33:36,589 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 249 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:36,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 1331 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 447 Invalid, 0 Unknown, 494 Unchecked, 0.3s Time] [2021-11-22 19:33:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-22 19:33:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 180. [2021-11-22 19:33:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 177 states have (on average 1.07909604519774) internal successors, (191), 179 states have internal predecessors, (191), 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-22 19:33:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2021-11-22 19:33:36,605 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 91 [2021-11-22 19:33:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:36,605 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2021-11-22 19:33:36,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.641025641025641) internal successors, (220), 39 states have internal predecessors, (220), 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-22 19:33:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2021-11-22 19:33:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:33:36,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:36,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:36,634 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-22 19:33:36,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:36,826 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -302629562, now seen corresponding path program 1 times [2021-11-22 19:33:36,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:36,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375335876] [2021-11-22 19:33:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:36,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:33:37,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:37,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375335876] [2021-11-22 19:33:37,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375335876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:37,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:37,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:37,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594362465] [2021-11-22 19:33:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:37,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:37,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:37,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:37,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:37,139 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-22 19:33:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:37,244 INFO L93 Difference]: Finished difference Result 206 states and 217 transitions. [2021-11-22 19:33:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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) Word has length 91 [2021-11-22 19:33:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:37,245 INFO L225 Difference]: With dead ends: 206 [2021-11-22 19:33:37,245 INFO L226 Difference]: Without dead ends: 185 [2021-11-22 19:33:37,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:37,246 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 169 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:37,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 367 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-22 19:33:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2021-11-22 19:33:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 177 states have (on average 1.073446327683616) internal successors, (190), 179 states have internal predecessors, (190), 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-22 19:33:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2021-11-22 19:33:37,255 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 91 [2021-11-22 19:33:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:37,255 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2021-11-22 19:33:37,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-22 19:33:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2021-11-22 19:33:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:33:37,256 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:37,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:37,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:33:37,256 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 377428808, now seen corresponding path program 1 times [2021-11-22 19:33:37,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:37,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533257205] [2021-11-22 19:33:37,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:37,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:33:37,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533257205] [2021-11-22 19:33:37,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533257205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:37,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:37,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:37,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246537352] [2021-11-22 19:33:37,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:37,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:37,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:37,488 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-22 19:33:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:37,607 INFO L93 Difference]: Finished difference Result 228 states and 238 transitions. [2021-11-22 19:33:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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) Word has length 91 [2021-11-22 19:33:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:37,608 INFO L225 Difference]: With dead ends: 228 [2021-11-22 19:33:37,608 INFO L226 Difference]: Without dead ends: 205 [2021-11-22 19:33:37,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:37,609 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 155 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:37,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 252 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-22 19:33:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 180. [2021-11-22 19:33:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 177 states have (on average 1.0677966101694916) internal successors, (189), 179 states have internal predecessors, (189), 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-22 19:33:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2021-11-22 19:33:37,615 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 91 [2021-11-22 19:33:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:37,616 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2021-11-22 19:33:37,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-22 19:33:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2021-11-22 19:33:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:33:37,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:37,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:37,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:33:37,617 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash -812228212, now seen corresponding path program 1 times [2021-11-22 19:33:37,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:37,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203911734] [2021-11-22 19:33:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:37,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:38,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203911734] [2021-11-22 19:33:38,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203911734] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:33:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532480514] [2021-11-22 19:33:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:38,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:38,268 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-22 19:33:38,269 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-22 19:33:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:38,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-22 19:33:38,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:33:38,904 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 6 treesize of output 5 [2021-11-22 19:33:39,122 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 44 treesize of output 28 [2021-11-22 19:33:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:33:39,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 19:33:39,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532480514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:39,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 19:33:39,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 20 [2021-11-22 19:33:39,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324066069] [2021-11-22 19:33:39,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:39,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:39,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:39,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:33:39,154 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-22 19:33:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:39,486 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2021-11-22 19:33:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:33:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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) Word has length 91 [2021-11-22 19:33:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:39,488 INFO L225 Difference]: With dead ends: 205 [2021-11-22 19:33:39,488 INFO L226 Difference]: Without dead ends: 171 [2021-11-22 19:33:39,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:33:39,489 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 416 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:39,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 234 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-22 19:33:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2021-11-22 19:33:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 129 states have (on average 1.062015503875969) internal successors, (137), 131 states have internal predecessors, (137), 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-22 19:33:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2021-11-22 19:33:39,494 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 91 [2021-11-22 19:33:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:39,494 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2021-11-22 19:33:39,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-22 19:33:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2021-11-22 19:33:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-22 19:33:39,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:39,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:39,518 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-22 19:33:39,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:39,700 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1538514047, now seen corresponding path program 1 times [2021-11-22 19:33:39,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:39,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264266378] [2021-11-22 19:33:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:39,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:33:39,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:39,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264266378] [2021-11-22 19:33:39,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264266378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:39,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:39,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:39,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524762144] [2021-11-22 19:33:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:39,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:39,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:39,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:39,840 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-22 19:33:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:39,944 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-11-22 19:33:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:33:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) Word has length 93 [2021-11-22 19:33:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:39,945 INFO L225 Difference]: With dead ends: 150 [2021-11-22 19:33:39,945 INFO L226 Difference]: Without dead ends: 128 [2021-11-22 19:33:39,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:39,945 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 132 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:39,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 270 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-22 19:33:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2021-11-22 19:33:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 123 states have internal predecessors, (128), 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-22 19:33:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2021-11-22 19:33:39,950 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 93 [2021-11-22 19:33:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:39,950 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2021-11-22 19:33:39,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-22 19:33:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2021-11-22 19:33:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:33:39,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:39,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:39,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:33:39,951 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1361624175, now seen corresponding path program 1 times [2021-11-22 19:33:39,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939530956] [2021-11-22 19:33:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:39,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 19:33:40,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939530956] [2021-11-22 19:33:40,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939530956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:40,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:40,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:33:40,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326742303] [2021-11-22 19:33:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:40,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:33:40,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:40,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:33:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:33:40,102 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-22 19:33:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:40,194 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-11-22 19:33:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:33:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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) Word has length 98 [2021-11-22 19:33:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:40,195 INFO L225 Difference]: With dead ends: 124 [2021-11-22 19:33:40,195 INFO L226 Difference]: Without dead ends: 118 [2021-11-22 19:33:40,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:40,196 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 57 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:40,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 251 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-22 19:33:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-22 19:33:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0341880341880343) internal successors, (121), 117 states have internal predecessors, (121), 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-22 19:33:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2021-11-22 19:33:40,200 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 98 [2021-11-22 19:33:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:40,200 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2021-11-22 19:33:40,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-22 19:33:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2021-11-22 19:33:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 19:33:40,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:40,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:33:40,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:33:40,201 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-22 19:33:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1330900889, now seen corresponding path program 1 times [2021-11-22 19:33:40,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:40,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097054716] [2021-11-22 19:33:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:40,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:42,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097054716] [2021-11-22 19:33:42,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097054716] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 19:33:42,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586462192] [2021-11-22 19:33:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:42,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 19:33:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:33:42,221 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-22 19:33:42,222 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-22 19:33:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:42,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 2681 conjuncts, 201 conjunts are in the unsatisfiable core [2021-11-22 19:33:42,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:33:43,021 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 19 treesize of output 15 [2021-11-22 19:33:43,025 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-22 19:33:43,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:33:43,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-11-22 19:33:43,911 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 19:33:43,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 139 treesize of output 134 [2021-11-22 19:33:43,924 INFO L354 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2021-11-22 19:33:43,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 111 [2021-11-22 19:33:43,936 INFO L354 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2021-11-22 19:33:43,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 113 [2021-11-22 19:33:43,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 107 [2021-11-22 19:33:43,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2021-11-22 19:33:44,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:33:44,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2021-11-22 19:33:44,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:33:44,375 INFO L354 Elim1Store]: treesize reduction 87, result has 17.9 percent of original size [2021-11-22 19:33:44,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 80 [2021-11-22 19:33:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 19:33:44,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2021-11-22 19:33:45,251 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 78 treesize of output 66 [2021-11-22 19:33:45,255 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 63 treesize of output 51 [2021-11-22 19:33:45,553 INFO L354 Elim1Store]: treesize reduction 102, result has 2.9 percent of original size [2021-11-22 19:33:45,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 70 [2021-11-22 19:33:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:33:45,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:34:20,419 WARN L227 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 204 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 19:34:58,100 INFO L354 Elim1Store]: treesize reduction 25, result has 55.4 percent of original size [2021-11-22 19:34:58,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 910 treesize of output 816 [2021-11-22 19:34:58,514 INFO L354 Elim1Store]: treesize reduction 25, result has 55.4 percent of original size [2021-11-22 19:34:58,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1522 treesize of output 1412 [2021-11-22 19:34:58,755 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:58,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2320 treesize of output 2212 [2021-11-22 19:34:58,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:34:58,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3836 treesize of output 3808 [2021-11-22 19:34:58,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5352 treesize of output 5288 [2021-11-22 19:34:58,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7492 treesize of output 7396 [2021-11-22 19:34:59,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-22 19:35:18,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 206 [2021-11-22 19:35:19,244 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:19,245 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 31 treesize of output 35 [2021-11-22 19:35:21,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 19:35:21,809 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 664 treesize of output 584 Killed by 15