./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_cursor_satisfies_pred_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 21e14c4abf3c8c626ff1e4d64bac7246a96ab8c19ab8b6f263006a7e1f8fc191 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:18:54,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:18:54,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:18:54,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:18:54,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:18:54,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:18:54,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:18:54,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:18:54,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:18:54,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:18:54,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:18:54,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:18:54,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:18:54,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:18:54,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:18:54,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:18:54,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:18:54,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:18:54,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:18:54,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:18:54,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:18:54,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:18:54,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:18:54,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:18:54,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:18:54,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:18:54,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:18:54,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:18:54,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:18:54,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:18:54,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:18:54,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:18:54,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:18:54,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:18:54,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:18:54,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:18:54,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:18:54,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:18:54,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:18:54,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:18:54,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:18:54,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 13:18:54,487 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:18:54,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:18:54,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:18:54,490 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:18:54,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:18:54,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:18:54,492 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:18:54,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:18:54,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 13:18:54,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:18:54,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:18:54,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:18:54,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:18:54,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:18:54,494 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:18:54,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:18:54,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:18:54,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:18:54,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:18:54,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:18:54,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:18:54,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:18:54,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:18:54,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 13:18:54,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 13:18:54,496 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:18:54,496 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:18:54,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:18:54,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:18:54,498 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 -> 21e14c4abf3c8c626ff1e4d64bac7246a96ab8c19ab8b6f263006a7e1f8fc191 [2021-11-02 13:18:54,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:18:54,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:18:54,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:18:54,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:18:54,723 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:18:54,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i [2021-11-02 13:18:54,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918d97c4/fffb8e708a2641e1b9031175c8ace0f2/FLAG522dcfba3 [2021-11-02 13:18:55,465 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:18:55,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i [2021-11-02 13:18:55,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918d97c4/fffb8e708a2641e1b9031175c8ace0f2/FLAG522dcfba3 [2021-11-02 13:18:55,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6918d97c4/fffb8e708a2641e1b9031175c8ace0f2 [2021-11-02 13:18:55,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:18:55,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:18:55,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:18:55,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:18:55,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:18:55,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:18:55" (1/1) ... [2021-11-02 13:18:55,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e92535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:55, skipping insertion in model container [2021-11-02 13:18:55,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:18:55" (1/1) ... [2021-11-02 13:18:55,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:18:55,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:18:56,118 WARN L228 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_cursor_satisfies_pred_harness.i[4504,4517] [2021-11-02 13:18:56,125 WARN L228 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_cursor_satisfies_pred_harness.i[4564,4577] [2021-11-02 13:18:56,143 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:18:56,149 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:18:56,904 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,905 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,905 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,906 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,907 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,925 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,928 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,930 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:56,930 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,205 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:18:57,206 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:18:57,207 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:18:57,208 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:18:57,211 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:18:57,211 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:18:57,212 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:18:57,213 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:18:57,215 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:18:57,216 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:18:57,340 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:18:57,407 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,418 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:18:57,504 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:18:57,525 WARN L228 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_cursor_satisfies_pred_harness.i[4504,4517] [2021-11-02 13:18:57,527 WARN L228 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_cursor_satisfies_pred_harness.i[4564,4577] [2021-11-02 13:18:57,528 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:18:57,529 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:18:57,563 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,565 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,573 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,573 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,575 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,575 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,617 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:18:57,618 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:18:57,618 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:18:57,619 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:18:57,619 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:18:57,620 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:18:57,620 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:18:57,620 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:18:57,621 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:18:57,621 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:18:57,653 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:18:57,710 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,710 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:57,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:18:57,942 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:18:57,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57 WrapperNode [2021-11-02 13:18:57,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:18:57,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:18:57,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:18:57,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:18:57,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:18:58,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:18:58,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:18:58,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:18:58,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:18:58,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:18:58,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:18:58,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:18:58,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (1/1) ... [2021-11-02 13:18:58,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:18:58,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:18:58,284 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-02 13:18:58,305 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-02 13:18:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:18:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 13:18:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 13:18:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 13:18:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:18:58,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:18:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:18:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 13:18:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:18:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 13:18:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 13:19:03,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:19:03,468 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2021-11-02 13:19:03,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:19:03 BoogieIcfgContainer [2021-11-02 13:19:03,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:19:03,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:19:03,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:19:03,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:19:03,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:18:55" (1/3) ... [2021-11-02 13:19:03,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30de48d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:19:03, skipping insertion in model container [2021-11-02 13:19:03,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:57" (2/3) ... [2021-11-02 13:19:03,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30de48d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:19:03, skipping insertion in model container [2021-11-02 13:19:03,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:19:03" (3/3) ... [2021-11-02 13:19:03,482 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_satisfies_pred_harness.i [2021-11-02 13:19:03,486 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:19:03,486 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 13:19:03,532 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:19:03,539 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-02 13:19:03,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 13:19:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 124 states have internal predecessors, (172), 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-02 13:19:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 13:19:03,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:03,571 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] [2021-11-02 13:19:03,572 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-02 13:19:03,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:03,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780455079] [2021-11-02 13:19:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:03,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:04,207 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-02 13:19:04,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:04,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780455079] [2021-11-02 13:19:04,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780455079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:04,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:04,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 13:19:04,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972379606] [2021-11-02 13:19:04,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:19:04,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:19:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:19:04,245 INFO L87 Difference]: Start difference. First operand has 125 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 124 states have internal predecessors, (172), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-02 13:19:06,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:07,295 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2021-11-02 13:19:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:19:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2021-11-02 13:19:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:07,305 INFO L225 Difference]: With dead ends: 246 [2021-11-02 13:19:07,305 INFO L226 Difference]: Without dead ends: 118 [2021-11-02 13:19:07,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:19:07,315 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2701.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.47ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2993.21ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:07,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 160 Unknown, 0 Unchecked, 2.47ms Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 1 Unknown, 0 Unchecked, 2993.21ms Time] [2021-11-02 13:19:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-02 13:19:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-02 13:19:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.336283185840708) internal successors, (151), 117 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-02 13:19:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2021-11-02 13:19:07,346 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 30 [2021-11-02 13:19:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:07,347 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2021-11-02 13:19:07,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-02 13:19:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2021-11-02 13:19:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 13:19:07,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:07,354 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] [2021-11-02 13:19:07,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 13:19:07,354 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-02 13:19:07,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:07,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610416735] [2021-11-02 13:19:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:07,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:07,653 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-02 13:19:07,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:07,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610416735] [2021-11-02 13:19:07,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610416735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:07,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:07,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:19:07,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604508139] [2021-11-02 13:19:07,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:19:07,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:19:07,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:19:07,657 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-02 13:19:09,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:10,686 INFO L93 Difference]: Finished difference Result 215 states and 275 transitions. [2021-11-02 13:19:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:19:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2021-11-02 13:19:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:10,688 INFO L225 Difference]: With dead ends: 215 [2021-11-02 13:19:10,688 INFO L226 Difference]: Without dead ends: 118 [2021-11-02 13:19:10,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.37ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:19:10,689 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2740.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.04ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2987.26ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:10,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 5.04ms Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 1 Unknown, 0 Unchecked, 2987.26ms Time] [2021-11-02 13:19:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-02 13:19:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-02 13:19:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 117 states have internal predecessors, (148), 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-02 13:19:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2021-11-02 13:19:10,697 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 32 [2021-11-02 13:19:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:10,698 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2021-11-02 13:19:10,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-02 13:19:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2021-11-02 13:19:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 13:19:10,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:10,699 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] [2021-11-02 13:19:10,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 13:19:10,700 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-02 13:19:10,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:10,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478105245] [2021-11-02 13:19:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:10,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:11,158 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-02 13:19:11,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:11,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478105245] [2021-11-02 13:19:11,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478105245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:11,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:11,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:19:11,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085334373] [2021-11-02 13:19:11,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:19:11,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:19:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:19:11,161 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-02 13:19:13,220 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:14,276 INFO L93 Difference]: Finished difference Result 176 states and 219 transitions. [2021-11-02 13:19:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:19:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 36 [2021-11-02 13:19:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:14,278 INFO L225 Difference]: With dead ends: 176 [2021-11-02 13:19:14,278 INFO L226 Difference]: Without dead ends: 118 [2021-11-02 13:19:14,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 228.02ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:19:14,280 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 452 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2749.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.11ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2975.74ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:14,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 7.11ms Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 1 Unknown, 0 Unchecked, 2975.74ms Time] [2021-11-02 13:19:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-02 13:19:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-02 13:19:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3008849557522124) 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-02 13:19:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2021-11-02 13:19:14,288 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 36 [2021-11-02 13:19:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:14,289 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2021-11-02 13:19:14,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-02 13:19:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2021-11-02 13:19:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 13:19:14,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:14,290 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] [2021-11-02 13:19:14,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 13:19:14,291 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-02 13:19:14,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:14,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086725659] [2021-11-02 13:19:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:14,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:14,947 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-02 13:19:14,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:14,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086725659] [2021-11-02 13:19:14,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086725659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:14,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:14,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:19:14,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103012858] [2021-11-02 13:19:14,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:19:14,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:19:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:19:14,949 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-02 13:19:17,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:20,298 INFO L93 Difference]: Finished difference Result 218 states and 263 transitions. [2021-11-02 13:19:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:19:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2021-11-02 13:19:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:20,301 INFO L225 Difference]: With dead ends: 218 [2021-11-02 13:19:20,301 INFO L226 Difference]: Without dead ends: 210 [2021-11-02 13:19:20,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 304.18ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 13:19:20,303 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4703.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.84ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5096.22ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:20,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 837 Unknown, 0 Unchecked, 11.84ms Time], IncrementalHoareTripleChecker [44 Valid, 792 Invalid, 1 Unknown, 0 Unchecked, 5096.22ms Time] [2021-11-02 13:19:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-02 13:19:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 134. [2021-11-02 13:19:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 133 states have internal predecessors, (163), 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-02 13:19:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2021-11-02 13:19:20,330 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 38 [2021-11-02 13:19:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:20,330 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2021-11-02 13:19:20,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-02 13:19:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2021-11-02 13:19:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 13:19:20,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:20,332 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] [2021-11-02 13:19:20,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 13:19:20,332 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-02 13:19:20,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:20,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501948826] [2021-11-02 13:19:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:20,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:20,832 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-02 13:19:20,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:20,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501948826] [2021-11-02 13:19:20,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501948826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:20,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:20,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:19:20,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653193497] [2021-11-02 13:19:20,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:19:20,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:20,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:19:20,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:19:20,835 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-02 13:19:21,950 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:24,292 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:26,467 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:28,602 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:30,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:32,856 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:34,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:40,162 INFO L93 Difference]: Finished difference Result 398 states and 480 transitions. [2021-11-02 13:19:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:19:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 42 [2021-11-02 13:19:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:40,166 INFO L225 Difference]: With dead ends: 398 [2021-11-02 13:19:40,166 INFO L226 Difference]: Without dead ends: 296 [2021-11-02 13:19:40,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 919.46ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:19:40,168 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 37 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17126.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.13ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18502.03ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:40,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 0 Invalid, 1063 Unknown, 0 Unchecked, 17.13ms Time], IncrementalHoareTripleChecker [37 Valid, 1020 Invalid, 6 Unknown, 0 Unchecked, 18502.03ms Time] [2021-11-02 13:19:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-11-02 13:19:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 226. [2021-11-02 13:19:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.253393665158371) internal successors, (277), 225 states have internal predecessors, (277), 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-02 13:19:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2021-11-02 13:19:40,198 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 42 [2021-11-02 13:19:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:40,200 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2021-11-02 13:19:40,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-02 13:19:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2021-11-02 13:19:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 13:19:40,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:40,219 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] [2021-11-02 13:19:40,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 13:19:40,220 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-02 13:19:40,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:40,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616534855] [2021-11-02 13:19:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:40,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:40,549 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-02 13:19:40,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:40,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616534855] [2021-11-02 13:19:40,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616534855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:40,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:40,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:19:40,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297997855] [2021-11-02 13:19:40,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:19:40,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:40,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:19:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:19:40,551 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-02 13:19:43,610 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:44,732 INFO L93 Difference]: Finished difference Result 302 states and 368 transitions. [2021-11-02 13:19:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:19:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2021-11-02 13:19:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:44,734 INFO L225 Difference]: With dead ends: 302 [2021-11-02 13:19:44,734 INFO L226 Difference]: Without dead ends: 226 [2021-11-02 13:19:44,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.71ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:19:44,736 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3897.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.75ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4131.52ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:44,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 322 Unknown, 0 Unchecked, 2.75ms Time], IncrementalHoareTripleChecker [5 Valid, 316 Invalid, 1 Unknown, 0 Unchecked, 4131.52ms Time] [2021-11-02 13:19:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-02 13:19:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-11-02 13:19:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.244343891402715) internal successors, (275), 225 states have internal predecessors, (275), 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-02 13:19:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2021-11-02 13:19:44,748 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 43 [2021-11-02 13:19:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:44,749 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2021-11-02 13:19:44,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-02 13:19:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2021-11-02 13:19:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 13:19:44,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:44,751 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:19:44,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 13:19:44,752 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-02 13:19:44,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:44,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208277790] [2021-11-02 13:19:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:44,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:19:44,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:44,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208277790] [2021-11-02 13:19:44,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208277790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:44,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:44,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 13:19:44,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377596364] [2021-11-02 13:19:44,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:19:44,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:19:44,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:19:44,955 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-02 13:19:47,019 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:47,948 INFO L93 Difference]: Finished difference Result 318 states and 388 transitions. [2021-11-02 13:19:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:19:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2021-11-02 13:19:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:47,950 INFO L225 Difference]: With dead ends: 318 [2021-11-02 13:19:47,950 INFO L226 Difference]: Without dead ends: 229 [2021-11-02 13:19:47,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.43ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:19:47,951 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2788.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2965.37ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:47,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 290 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 1 Unknown, 0 Unchecked, 2965.37ms Time] [2021-11-02 13:19:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-02 13:19:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-11-02 13:19:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2410714285714286) internal successors, (278), 228 states have internal predecessors, (278), 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-02 13:19:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 278 transitions. [2021-11-02 13:19:47,961 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 278 transitions. Word has length 45 [2021-11-02 13:19:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:47,961 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 278 transitions. [2021-11-02 13:19:47,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-02 13:19:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 278 transitions. [2021-11-02 13:19:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 13:19:47,962 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:47,962 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] [2021-11-02 13:19:47,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 13:19:47,963 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 959658833, now seen corresponding path program 1 times [2021-11-02 13:19:47,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:47,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237803097] [2021-11-02 13:19:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:47,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:48,281 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-02 13:19:48,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:48,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237803097] [2021-11-02 13:19:48,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237803097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:48,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:48,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:19:48,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843471132] [2021-11-02 13:19:48,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:19:48,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:19:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:19:48,283 INFO L87 Difference]: Start difference. First operand 229 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-02 13:19:50,777 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:53,259 INFO L93 Difference]: Finished difference Result 562 states and 673 transitions. [2021-11-02 13:19:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:19:53,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 45 [2021-11-02 13:19:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:53,261 INFO L225 Difference]: With dead ends: 562 [2021-11-02 13:19:53,261 INFO L226 Difference]: Without dead ends: 384 [2021-11-02 13:19:53,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 488.72ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:19:53,263 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 738 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4145.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.22ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4509.07ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:53,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 0 Invalid, 554 Unknown, 0 Unchecked, 9.22ms Time], IncrementalHoareTripleChecker [26 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 4509.07ms Time] [2021-11-02 13:19:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-02 13:19:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 229. [2021-11-02 13:19:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2366071428571428) internal successors, (277), 228 states have internal predecessors, (277), 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-02 13:19:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 277 transitions. [2021-11-02 13:19:53,285 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 277 transitions. Word has length 45 [2021-11-02 13:19:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:53,285 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 277 transitions. [2021-11-02 13:19:53,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-02 13:19:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 277 transitions. [2021-11-02 13:19:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 13:19:53,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:53,286 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] [2021-11-02 13:19:53,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 13:19:53,287 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-02 13:19:53,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:53,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853851099] [2021-11-02 13:19:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:53,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:53,868 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-02 13:19:53,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:53,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853851099] [2021-11-02 13:19:53,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853851099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:53,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:53,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:19:53,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440742677] [2021-11-02 13:19:53,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:19:53,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:53,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:19:53,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:19:53,870 INFO L87 Difference]: Start difference. First operand 229 states and 277 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-02 13:19:57,605 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:00,703 INFO L93 Difference]: Finished difference Result 465 states and 565 transitions. [2021-11-02 13:20:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:20:00,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 46 [2021-11-02 13:20:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:00,705 INFO L225 Difference]: With dead ends: 465 [2021-11-02 13:20:00,705 INFO L226 Difference]: Without dead ends: 306 [2021-11-02 13:20:00,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 478.00ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:20:00,706 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 330 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6149.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.19ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6524.30ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:00,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 0 Invalid, 1017 Unknown, 0 Unchecked, 8.19ms Time], IncrementalHoareTripleChecker [30 Valid, 986 Invalid, 1 Unknown, 0 Unchecked, 6524.30ms Time] [2021-11-02 13:20:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-02 13:20:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 294. [2021-11-02 13:20:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 289 states have (on average 1.245674740484429) internal successors, (360), 293 states have internal predecessors, (360), 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-02 13:20:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 360 transitions. [2021-11-02 13:20:00,717 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 360 transitions. Word has length 46 [2021-11-02 13:20:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:00,717 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 360 transitions. [2021-11-02 13:20:00,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-02 13:20:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 360 transitions. [2021-11-02 13:20:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 13:20:00,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:00,718 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:20:00,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 13:20:00,719 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-02 13:20:00,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:00,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336334428] [2021-11-02 13:20:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:00,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 13:20:01,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:01,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336334428] [2021-11-02 13:20:01,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336334428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:01,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:01,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:20:01,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715739673] [2021-11-02 13:20:01,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:20:01,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:20:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:20:01,084 INFO L87 Difference]: Start difference. First operand 294 states and 360 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-02 13:20:03,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:05,422 INFO L93 Difference]: Finished difference Result 551 states and 672 transitions. [2021-11-02 13:20:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:20:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-02 13:20:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:05,425 INFO L225 Difference]: With dead ends: 551 [2021-11-02 13:20:05,425 INFO L226 Difference]: Without dead ends: 396 [2021-11-02 13:20:05,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 307.76ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:20:05,426 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3863.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.85ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4102.06ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:05,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 700 Unknown, 0 Unchecked, 6.85ms Time], IncrementalHoareTripleChecker [23 Valid, 676 Invalid, 1 Unknown, 0 Unchecked, 4102.06ms Time] [2021-11-02 13:20:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-02 13:20:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 288. [2021-11-02 13:20:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.2367491166077738) internal successors, (350), 287 states have internal predecessors, (350), 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-02 13:20:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 350 transitions. [2021-11-02 13:20:05,438 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 350 transitions. Word has length 47 [2021-11-02 13:20:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:05,438 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 350 transitions. [2021-11-02 13:20:05,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-02 13:20:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 350 transitions. [2021-11-02 13:20:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-02 13:20:05,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:05,439 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] [2021-11-02 13:20:05,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 13:20:05,440 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-02 13:20:05,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:05,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753769665] [2021-11-02 13:20:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:05,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:05,820 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-02 13:20:05,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:05,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753769665] [2021-11-02 13:20:05,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753769665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:05,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:05,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:20:05,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059222753] [2021-11-02 13:20:05,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:20:05,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:05,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:20:05,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:20:05,822 INFO L87 Difference]: Start difference. First operand 288 states and 350 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-02 13:20:08,290 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:11,135 INFO L93 Difference]: Finished difference Result 437 states and 525 transitions. [2021-11-02 13:20:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 13:20:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 49 [2021-11-02 13:20:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:11,137 INFO L225 Difference]: With dead ends: 437 [2021-11-02 13:20:11,137 INFO L226 Difference]: Without dead ends: 372 [2021-11-02 13:20:11,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 549.40ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:20:11,139 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4539.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.50ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4858.27ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:11,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 862 Unknown, 0 Unchecked, 6.50ms Time], IncrementalHoareTripleChecker [39 Valid, 822 Invalid, 1 Unknown, 0 Unchecked, 4858.27ms Time] [2021-11-02 13:20:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-02 13:20:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 255. [2021-11-02 13:20:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 250 states have (on average 1.228) internal successors, (307), 254 states have internal predecessors, (307), 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-02 13:20:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 307 transitions. [2021-11-02 13:20:11,149 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 307 transitions. Word has length 49 [2021-11-02 13:20:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:11,149 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 307 transitions. [2021-11-02 13:20:11,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-02 13:20:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 307 transitions. [2021-11-02 13:20:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:20:11,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:11,150 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] [2021-11-02 13:20:11,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 13:20:11,151 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -320354742, now seen corresponding path program 1 times [2021-11-02 13:20:11,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:11,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479009930] [2021-11-02 13:20:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:11,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:11,752 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-02 13:20:11,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:11,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479009930] [2021-11-02 13:20:11,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479009930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:11,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:11,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:20:11,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984160362] [2021-11-02 13:20:11,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:20:11,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:11,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:20:11,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:20:11,754 INFO L87 Difference]: Start difference. First operand 255 states and 307 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:20:14,925 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:21,388 INFO L93 Difference]: Finished difference Result 547 states and 656 transitions. [2021-11-02 13:20:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 13:20:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 50 [2021-11-02 13:20:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:21,390 INFO L225 Difference]: With dead ends: 547 [2021-11-02 13:20:21,390 INFO L226 Difference]: Without dead ends: 466 [2021-11-02 13:20:21,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 919.03ms TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:20:21,391 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 567 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8293.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.81ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8838.75ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:21,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 0 Invalid, 1643 Unknown, 0 Unchecked, 14.81ms Time], IncrementalHoareTripleChecker [25 Valid, 1617 Invalid, 1 Unknown, 0 Unchecked, 8838.75ms Time] [2021-11-02 13:20:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-11-02 13:20:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 284. [2021-11-02 13:20:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.2258064516129032) internal successors, (342), 283 states have internal predecessors, (342), 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-02 13:20:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 342 transitions. [2021-11-02 13:20:21,402 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 342 transitions. Word has length 50 [2021-11-02 13:20:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:21,402 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 342 transitions. [2021-11-02 13:20:21,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:20:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 342 transitions. [2021-11-02 13:20:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:20:21,403 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:21,403 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] [2021-11-02 13:20:21,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 13:20:21,404 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2129245388, now seen corresponding path program 1 times [2021-11-02 13:20:21,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:21,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891400034] [2021-11-02 13:20:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:21,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:21,890 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-02 13:20:21,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:21,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891400034] [2021-11-02 13:20:21,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891400034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:21,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:21,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:20:21,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311855978] [2021-11-02 13:20:21,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:20:21,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:21,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:20:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:20:21,892 INFO L87 Difference]: Start difference. First operand 284 states and 342 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-02 13:20:24,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:27,813 INFO L93 Difference]: Finished difference Result 803 states and 974 transitions. [2021-11-02 13:20:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:20:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 50 [2021-11-02 13:20:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:27,815 INFO L225 Difference]: With dead ends: 803 [2021-11-02 13:20:27,815 INFO L226 Difference]: Without dead ends: 586 [2021-11-02 13:20:27,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 489.77ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:20:27,816 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 602 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5203.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.75ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5538.11ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:27,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 0 Invalid, 1267 Unknown, 0 Unchecked, 7.75ms Time], IncrementalHoareTripleChecker [32 Valid, 1234 Invalid, 1 Unknown, 0 Unchecked, 5538.11ms Time] [2021-11-02 13:20:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-11-02 13:20:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 374. [2021-11-02 13:20:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 369 states have (on average 1.2276422764227641) internal successors, (453), 373 states have internal predecessors, (453), 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-02 13:20:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 453 transitions. [2021-11-02 13:20:27,830 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 453 transitions. Word has length 50 [2021-11-02 13:20:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:27,830 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 453 transitions. [2021-11-02 13:20:27,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-02 13:20:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 453 transitions. [2021-11-02 13:20:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:20:27,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:27,831 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] [2021-11-02 13:20:27,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 13:20:27,832 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2103682294, now seen corresponding path program 1 times [2021-11-02 13:20:27,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:27,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789645519] [2021-11-02 13:20:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:27,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:28,368 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-02 13:20:28,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:28,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789645519] [2021-11-02 13:20:28,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789645519] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:28,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:28,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:20:28,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898388415] [2021-11-02 13:20:28,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:20:28,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:28,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:20:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:20:28,370 INFO L87 Difference]: Start difference. First operand 374 states and 453 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:20:30,973 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:35,397 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2021-11-02 13:20:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:20:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 50 [2021-11-02 13:20:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:35,400 INFO L225 Difference]: With dead ends: 651 [2021-11-02 13:20:35,400 INFO L226 Difference]: Without dead ends: 579 [2021-11-02 13:20:35,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 738.93ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-02 13:20:35,401 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 815 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6044.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.80ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6427.54ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:35,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 0 Invalid, 1423 Unknown, 0 Unchecked, 10.80ms Time], IncrementalHoareTripleChecker [36 Valid, 1386 Invalid, 1 Unknown, 0 Unchecked, 6427.54ms Time] [2021-11-02 13:20:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-11-02 13:20:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 396. [2021-11-02 13:20:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.227621483375959) internal successors, (480), 395 states have internal predecessors, (480), 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-02 13:20:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 480 transitions. [2021-11-02 13:20:35,416 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 480 transitions. Word has length 50 [2021-11-02 13:20:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:35,417 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 480 transitions. [2021-11-02 13:20:35,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:20:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 480 transitions. [2021-11-02 13:20:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:20:35,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:35,418 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] [2021-11-02 13:20:35,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 13:20:35,418 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1423623924, now seen corresponding path program 1 times [2021-11-02 13:20:35,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:35,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297663656] [2021-11-02 13:20:35,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:35,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:35,960 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-02 13:20:35,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:35,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297663656] [2021-11-02 13:20:35,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297663656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:35,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:35,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:20:35,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138171743] [2021-11-02 13:20:35,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:20:35,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:20:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:20:35,962 INFO L87 Difference]: Start difference. First operand 396 states and 480 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-02 13:20:39,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:42,764 INFO L93 Difference]: Finished difference Result 875 states and 1042 transitions. [2021-11-02 13:20:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 13:20:42,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2021-11-02 13:20:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:42,766 INFO L225 Difference]: With dead ends: 875 [2021-11-02 13:20:42,766 INFO L226 Difference]: Without dead ends: 486 [2021-11-02 13:20:42,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 255.96ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 13:20:42,768 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6221.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.76ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6629.14ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:42,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 973 Unknown, 0 Unchecked, 5.76ms Time], IncrementalHoareTripleChecker [35 Valid, 937 Invalid, 1 Unknown, 0 Unchecked, 6629.14ms Time] [2021-11-02 13:20:42,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-11-02 13:20:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 396. [2021-11-02 13:20:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.2097186700767264) internal successors, (473), 395 states have internal predecessors, (473), 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-02 13:20:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 473 transitions. [2021-11-02 13:20:42,782 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 473 transitions. Word has length 50 [2021-11-02 13:20:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:42,782 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 473 transitions. [2021-11-02 13:20:42,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-02 13:20:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 473 transitions. [2021-11-02 13:20:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 13:20:42,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:42,784 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-02 13:20:42,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 13:20:42,784 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1316272933, now seen corresponding path program 1 times [2021-11-02 13:20:42,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:42,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684248334] [2021-11-02 13:20:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:42,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:43,095 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-02 13:20:43,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:43,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684248334] [2021-11-02 13:20:43,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684248334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:43,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:43,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:20:43,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237581968] [2021-11-02 13:20:43,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:20:43,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:20:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:20:43,096 INFO L87 Difference]: Start difference. First operand 396 states and 473 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-02 13:20:45,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:47,045 INFO L93 Difference]: Finished difference Result 449 states and 532 transitions. [2021-11-02 13:20:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:20:47,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-02 13:20:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:47,047 INFO L225 Difference]: With dead ends: 449 [2021-11-02 13:20:47,047 INFO L226 Difference]: Without dead ends: 396 [2021-11-02 13:20:47,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 244.71ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:20:47,048 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 551 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3495.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.59ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3783.37ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:47,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 2.59ms Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 1 Unknown, 0 Unchecked, 3783.37ms Time] [2021-11-02 13:20:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-02 13:20:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2021-11-02 13:20:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.1994884910485935) internal successors, (469), 395 states have internal predecessors, (469), 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-02 13:20:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 469 transitions. [2021-11-02 13:20:47,080 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 469 transitions. Word has length 51 [2021-11-02 13:20:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:47,080 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 469 transitions. [2021-11-02 13:20:47,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-02 13:20:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 469 transitions. [2021-11-02 13:20:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 13:20:47,081 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:47,082 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] [2021-11-02 13:20:47,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 13:20:47,089 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash -905295060, now seen corresponding path program 1 times [2021-11-02 13:20:47,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:47,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028942061] [2021-11-02 13:20:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:47,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:47,360 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-02 13:20:47,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:47,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028942061] [2021-11-02 13:20:47,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028942061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:47,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:47,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:20:47,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849140269] [2021-11-02 13:20:47,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:20:47,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:47,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:20:47,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:20:47,361 INFO L87 Difference]: Start difference. First operand 396 states and 469 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-02 13:20:49,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:50,921 INFO L93 Difference]: Finished difference Result 607 states and 719 transitions. [2021-11-02 13:20:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:20:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2021-11-02 13:20:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:50,922 INFO L225 Difference]: With dead ends: 607 [2021-11-02 13:20:50,923 INFO L226 Difference]: Without dead ends: 334 [2021-11-02 13:20:50,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:20:50,924 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3246.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3505.00ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:50,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 465 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [19 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 3505.00ms Time] [2021-11-02 13:20:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-02 13:20:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 286. [2021-11-02 13:20:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.1814946619217082) internal successors, (332), 285 states have internal predecessors, (332), 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-02 13:20:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 332 transitions. [2021-11-02 13:20:50,934 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 332 transitions. Word has length 54 [2021-11-02 13:20:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:50,935 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 332 transitions. [2021-11-02 13:20:50,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-02 13:20:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 332 transitions. [2021-11-02 13:20:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 13:20:50,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:50,936 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] [2021-11-02 13:20:50,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 13:20:50,936 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1686129362, now seen corresponding path program 1 times [2021-11-02 13:20:50,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:50,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385195766] [2021-11-02 13:20:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:50,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:51,156 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-02 13:20:51,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:51,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385195766] [2021-11-02 13:20:51,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385195766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:51,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:51,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:20:51,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382841154] [2021-11-02 13:20:51,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:20:51,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:51,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:20:51,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:20:51,158 INFO L87 Difference]: Start difference. First operand 286 states and 332 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-02 13:20:53,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:55,238 INFO L93 Difference]: Finished difference Result 563 states and 651 transitions. [2021-11-02 13:20:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:20:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2021-11-02 13:20:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:55,240 INFO L225 Difference]: With dead ends: 563 [2021-11-02 13:20:55,240 INFO L226 Difference]: Without dead ends: 304 [2021-11-02 13:20:55,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 79.75ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:20:55,241 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3778.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.65ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4031.46ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:55,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 519 Unknown, 0 Unchecked, 2.65ms Time], IncrementalHoareTripleChecker [26 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 4031.46ms Time] [2021-11-02 13:20:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-02 13:20:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2021-11-02 13:20:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 281 states have (on average 1.1423487544483986) internal successors, (321), 285 states have internal predecessors, (321), 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-02 13:20:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 321 transitions. [2021-11-02 13:20:55,250 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 321 transitions. Word has length 56 [2021-11-02 13:20:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:55,250 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 321 transitions. [2021-11-02 13:20:55,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-02 13:20:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 321 transitions. [2021-11-02 13:20:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 13:20:55,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:55,251 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] [2021-11-02 13:20:55,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 13:20:55,252 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-02 13:20:55,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:55,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198078098] [2021-11-02 13:20:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:55,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:57,789 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-02 13:20:57,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:57,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198078098] [2021-11-02 13:20:57,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198078098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:57,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:57,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:20:57,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699911577] [2021-11-02 13:20:57,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:20:57,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:57,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:20:57,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:20:57,790 INFO L87 Difference]: Start difference. First operand 286 states and 321 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 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-02 13:20:59,035 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:00,451 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:02,234 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:03,965 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:06,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:08,726 INFO L93 Difference]: Finished difference Result 622 states and 693 transitions. [2021-11-02 13:21:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:21:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 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 56 [2021-11-02 13:21:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:08,728 INFO L225 Difference]: With dead ends: 622 [2021-11-02 13:21:08,728 INFO L226 Difference]: Without dead ends: 359 [2021-11-02 13:21:08,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 536.49ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:21:08,731 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8751.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.33ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10668.97ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:08,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 715 Unknown, 0 Unchecked, 5.33ms Time], IncrementalHoareTripleChecker [6 Valid, 708 Invalid, 1 Unknown, 0 Unchecked, 10668.97ms Time] [2021-11-02 13:21:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-11-02 13:21:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 290. [2021-11-02 13:21:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 285 states have (on average 1.1403508771929824) internal successors, (325), 289 states have internal predecessors, (325), 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-02 13:21:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 325 transitions. [2021-11-02 13:21:08,742 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 325 transitions. Word has length 56 [2021-11-02 13:21:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:08,742 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 325 transitions. [2021-11-02 13:21:08,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 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-02 13:21:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 325 transitions. [2021-11-02 13:21:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-02 13:21:08,743 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:08,743 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] [2021-11-02 13:21:08,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 13:21:08,744 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1362100250, now seen corresponding path program 1 times [2021-11-02 13:21:08,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:08,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871693444] [2021-11-02 13:21:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:08,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:09,140 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-02 13:21:09,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:09,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871693444] [2021-11-02 13:21:09,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871693444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:09,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:09,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:21:09,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711993506] [2021-11-02 13:21:09,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:21:09,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:21:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:21:09,142 INFO L87 Difference]: Start difference. First operand 290 states and 325 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-02 13:21:12,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:14,578 INFO L93 Difference]: Finished difference Result 372 states and 406 transitions. [2021-11-02 13:21:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:21:14,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 57 [2021-11-02 13:21:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:14,580 INFO L225 Difference]: With dead ends: 372 [2021-11-02 13:21:14,580 INFO L226 Difference]: Without dead ends: 344 [2021-11-02 13:21:14,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 561.56ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:21:14,581 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 453 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4517.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.40ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5007.97ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:14,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 4.40ms Time], IncrementalHoareTripleChecker [50 Valid, 725 Invalid, 1 Unknown, 0 Unchecked, 5007.97ms Time] [2021-11-02 13:21:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-11-02 13:21:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 318. [2021-11-02 13:21:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.1277955271565496) internal successors, (353), 317 states have internal predecessors, (353), 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-02 13:21:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 353 transitions. [2021-11-02 13:21:14,593 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 353 transitions. Word has length 57 [2021-11-02 13:21:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:14,593 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 353 transitions. [2021-11-02 13:21:14,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-02 13:21:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 353 transitions. [2021-11-02 13:21:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 13:21:14,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:14,594 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-02 13:21:14,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 13:21:14,595 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:14,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-02 13:21:14,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:14,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124009254] [2021-11-02 13:21:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:14,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:18,262 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-02 13:21:18,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:18,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124009254] [2021-11-02 13:21:18,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124009254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:18,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:18,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 13:21:18,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984034126] [2021-11-02 13:21:18,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 13:21:18,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 13:21:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:21:18,264 INFO L87 Difference]: Start difference. First operand 318 states and 353 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 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-02 13:21:21,050 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:25,099 INFO L93 Difference]: Finished difference Result 554 states and 613 transitions. [2021-11-02 13:21:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:21:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 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-02 13:21:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:25,101 INFO L225 Difference]: With dead ends: 554 [2021-11-02 13:21:25,101 INFO L226 Difference]: Without dead ends: 373 [2021-11-02 13:21:25,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 976.74ms TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2021-11-02 13:21:25,102 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 673 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5735.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.81ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6293.56ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:25,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 0 Invalid, 1339 Unknown, 0 Unchecked, 9.81ms Time], IncrementalHoareTripleChecker [16 Valid, 1322 Invalid, 1 Unknown, 0 Unchecked, 6293.56ms Time] [2021-11-02 13:21:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-11-02 13:21:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 300. [2021-11-02 13:21:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.1322033898305084) internal successors, (334), 299 states have internal predecessors, (334), 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-02 13:21:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 334 transitions. [2021-11-02 13:21:25,114 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 334 transitions. Word has length 59 [2021-11-02 13:21:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:25,115 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 334 transitions. [2021-11-02 13:21:25,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 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-02 13:21:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 334 transitions. [2021-11-02 13:21:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 13:21:25,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:25,116 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] [2021-11-02 13:21:25,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 13:21:25,116 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1792584358, now seen corresponding path program 1 times [2021-11-02 13:21:25,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:25,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592626484] [2021-11-02 13:21:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:25,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:25,526 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-02 13:21:25,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:25,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592626484] [2021-11-02 13:21:25,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592626484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:25,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:25,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:21:25,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546610925] [2021-11-02 13:21:25,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:21:25,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:21:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:21:25,528 INFO L87 Difference]: Start difference. First operand 300 states and 334 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-02 13:21:27,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:30,712 INFO L93 Difference]: Finished difference Result 497 states and 547 transitions. [2021-11-02 13:21:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:21:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 60 [2021-11-02 13:21:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:30,714 INFO L225 Difference]: With dead ends: 497 [2021-11-02 13:21:30,715 INFO L226 Difference]: Without dead ends: 408 [2021-11-02 13:21:30,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 514.89ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:21:30,716 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4391.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.45ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4771.28ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:30,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 1069 Unknown, 0 Unchecked, 6.45ms Time], IncrementalHoareTripleChecker [19 Valid, 1049 Invalid, 1 Unknown, 0 Unchecked, 4771.28ms Time] [2021-11-02 13:21:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-02 13:21:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 299. [2021-11-02 13:21:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.129251700680272) internal successors, (332), 298 states have internal predecessors, (332), 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-02 13:21:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2021-11-02 13:21:30,728 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 60 [2021-11-02 13:21:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:30,728 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2021-11-02 13:21:30,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-02 13:21:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2021-11-02 13:21:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 13:21:30,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:30,730 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] [2021-11-02 13:21:30,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 13:21:30,730 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-02 13:21:30,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:30,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653073004] [2021-11-02 13:21:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:30,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:36,359 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-02 13:21:36,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:36,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653073004] [2021-11-02 13:21:36,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653073004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:36,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:36,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 13:21:36,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184674591] [2021-11-02 13:21:36,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:21:36,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:21:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:21:36,362 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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-02 13:21:38,501 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:46,992 INFO L93 Difference]: Finished difference Result 472 states and 509 transitions. [2021-11-02 13:21:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 13:21:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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 62 [2021-11-02 13:21:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:46,994 INFO L225 Difference]: With dead ends: 472 [2021-11-02 13:21:46,994 INFO L226 Difference]: Without dead ends: 398 [2021-11-02 13:21:46,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3223.94ms TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2021-11-02 13:21:46,996 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 896 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7693.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.35ms SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8218.38ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:46,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 0 Invalid, 2460 Unknown, 0 Unchecked, 19.35ms Time], IncrementalHoareTripleChecker [63 Valid, 2396 Invalid, 1 Unknown, 0 Unchecked, 8218.38ms Time] [2021-11-02 13:21:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-02 13:21:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 302. [2021-11-02 13:21:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.127946127946128) internal successors, (335), 301 states have internal predecessors, (335), 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-02 13:21:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 335 transitions. [2021-11-02 13:21:47,010 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 335 transitions. Word has length 62 [2021-11-02 13:21:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:47,010 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 335 transitions. [2021-11-02 13:21:47,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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-02 13:21:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 335 transitions. [2021-11-02 13:21:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 13:21:47,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:47,011 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] [2021-11-02 13:21:47,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 13:21:47,012 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1670378592, now seen corresponding path program 1 times [2021-11-02 13:21:47,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:47,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135870475] [2021-11-02 13:21:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:47,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:47,495 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-02 13:21:47,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:47,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135870475] [2021-11-02 13:21:47,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135870475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:47,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:47,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:21:47,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691630409] [2021-11-02 13:21:47,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:21:47,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:47,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:21:47,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:21:47,497 INFO L87 Difference]: Start difference. First operand 302 states and 335 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-02 13:21:50,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:53,018 INFO L93 Difference]: Finished difference Result 454 states and 501 transitions. [2021-11-02 13:21:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 13:21:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 62 [2021-11-02 13:21:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:53,020 INFO L225 Difference]: With dead ends: 454 [2021-11-02 13:21:53,020 INFO L226 Difference]: Without dead ends: 378 [2021-11-02 13:21:53,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 222.31ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:21:53,021 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4980.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.04ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5452.65ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:53,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 973 Unknown, 0 Unchecked, 5.04ms Time], IncrementalHoareTripleChecker [14 Valid, 958 Invalid, 1 Unknown, 0 Unchecked, 5452.65ms Time] [2021-11-02 13:21:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-11-02 13:21:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 300. [2021-11-02 13:21:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.1254237288135593) internal successors, (332), 299 states have internal predecessors, (332), 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-02 13:21:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 332 transitions. [2021-11-02 13:21:53,034 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 332 transitions. Word has length 62 [2021-11-02 13:21:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:53,034 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 332 transitions. [2021-11-02 13:21:53,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-02 13:21:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 332 transitions. [2021-11-02 13:21:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 13:21:53,035 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:53,035 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] [2021-11-02 13:21:53,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 13:21:53,036 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-02 13:21:53,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:53,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423131535] [2021-11-02 13:21:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:53,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:53,785 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-02 13:21:53,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:53,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423131535] [2021-11-02 13:21:53,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423131535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:53,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:53,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 13:21:53,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635926604] [2021-11-02 13:21:53,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 13:21:53,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 13:21:53,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:21:53,787 INFO L87 Difference]: Start difference. First operand 300 states and 332 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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-02 13:21:55,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:22:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:22:00,425 INFO L93 Difference]: Finished difference Result 465 states and 511 transitions. [2021-11-02 13:22:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 13:22:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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 64 [2021-11-02 13:22:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:22:00,427 INFO L225 Difference]: With dead ends: 465 [2021-11-02 13:22:00,427 INFO L226 Difference]: Without dead ends: 457 [2021-11-02 13:22:00,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1336.06ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-02 13:22:00,428 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 289 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 196 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5156.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.11ms SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5584.21ms IncrementalHoareTripleChecker+Time [2021-11-02 13:22:00,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 0 Invalid, 1595 Unknown, 0 Unchecked, 8.11ms Time], IncrementalHoareTripleChecker [196 Valid, 1398 Invalid, 1 Unknown, 0 Unchecked, 5584.21ms Time] [2021-11-02 13:22:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-02 13:22:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 303. [2021-11-02 13:22:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 298 states have (on average 1.1208053691275168) internal successors, (334), 302 states have internal predecessors, (334), 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-02 13:22:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 334 transitions. [2021-11-02 13:22:00,441 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 334 transitions. Word has length 64 [2021-11-02 13:22:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:22:00,441 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 334 transitions. [2021-11-02 13:22:00,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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-02 13:22:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 334 transitions. [2021-11-02 13:22:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 13:22:00,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:22:00,443 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] [2021-11-02 13:22:00,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 13:22:00,443 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:22:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:22:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1997517733, now seen corresponding path program 1 times [2021-11-02 13:22:00,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:22:00,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063832386] [2021-11-02 13:22:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:22:00,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:22:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:22:00,713 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-02 13:22:00,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:22:00,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063832386] [2021-11-02 13:22:00,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063832386] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:22:00,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:22:00,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:22:00,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676309540] [2021-11-02 13:22:00,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:22:00,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:22:00,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:22:00,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:22:00,715 INFO L87 Difference]: Start difference. First operand 303 states and 334 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-02 13:22:03,604 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:22:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:22:05,234 INFO L93 Difference]: Finished difference Result 315 states and 344 transitions. [2021-11-02 13:22:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 13:22:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65 [2021-11-02 13:22:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:22:05,235 INFO L225 Difference]: With dead ends: 315 [2021-11-02 13:22:05,235 INFO L226 Difference]: Without dead ends: 253 [2021-11-02 13:22:05,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 172.65ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:22:05,236 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3954.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.80ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4396.94ms IncrementalHoareTripleChecker+Time [2021-11-02 13:22:05,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 479 Unknown, 0 Unchecked, 2.80ms Time], IncrementalHoareTripleChecker [13 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 4396.94ms Time] [2021-11-02 13:22:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-02 13:22:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2021-11-02 13:22:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.1229508196721312) internal successors, (274), 248 states have internal predecessors, (274), 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-02 13:22:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2021-11-02 13:22:05,248 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 65 [2021-11-02 13:22:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:22:05,248 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2021-11-02 13:22:05,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-02 13:22:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2021-11-02 13:22:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 13:22:05,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:22:05,249 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:22:05,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-02 13:22:05,250 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:22:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:22:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-02 13:22:05,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:22:05,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402286947] [2021-11-02 13:22:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:22:05,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:22:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:22:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:22:09,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:22:09,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402286947] [2021-11-02 13:22:09,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402286947] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:22:09,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148293955] [2021-11-02 13:22:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:22:09,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:22:09,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:22:09,259 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-02 13:22:09,260 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-02 13:22:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:22:10,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 2960 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-02 13:22:10,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:22:10,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-02 13:22:10,655 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-02 13:22:10,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-02 13:22:11,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-02 13:22:11,640 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-02 13:22:11,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-02 13:22:11,829 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 32 treesize of output 16 [2021-11-02 13:22:11,952 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-02 13:22:11,953 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 40 treesize of output 20 [2021-11-02 13:22:12,619 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-02 13:22:12,619 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 34 treesize of output 44 [2021-11-02 13:22:12,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:22:12,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:22:12,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-11-02 13:22:12,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:22:12,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:22:12,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2021-11-02 13:22:13,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:22:13,411 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 27 treesize of output 27 [2021-11-02 13:22:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 13:22:13,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:22:14,212 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-02 13:22:14,212 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 15 treesize of output 14 [2021-11-02 13:22:16,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) is different from false [2021-11-02 13:22:18,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0)))) is different from false [2021-11-02 13:22:21,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)))))) is different from false [2021-11-02 13:22:23,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)) (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)))) is different from false [2021-11-02 13:22:26,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)))) is different from false [2021-11-02 13:22:30,539 INFO L354 Elim1Store]: treesize reduction 184, result has 32.8 percent of original size [2021-11-02 13:22:30,540 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 4 case distinctions, treesize of input 195584 treesize of output 127321 [2021-11-02 13:22:31,456 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:22:31,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131399 treesize of output 125811 [2021-11-02 13:22:38,257 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-02 13:22:38,325 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:22:38,325 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 32 treesize of output 36 [2021-11-02 13:22:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-02 13:22:40,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148293955] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:22:40,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 13:22:40,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 40 [2021-11-02 13:22:40,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886858495] [2021-11-02 13:22:40,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-02 13:22:40,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:22:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-02 13:22:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1043, Unknown=5, NotChecked=350, Total=1560 [2021-11-02 13:22:40,996 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 40 states, 40 states have (on average 4.225) internal successors, (169), 40 states have internal predecessors, (169), 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-02 13:22:43,923 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:22:47,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 8)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|))) (and (not (= .cse0 0)) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_bounded_malloc_#res.base| 0)) (= c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (= .cse1 1) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base| c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_bounded_malloc_#res.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse2 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse3 (store (select .cse2 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse3 8 (select .cse3 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)))) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)))) is different from false [2021-11-02 13:22:49,567 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 8))) (and (not (= .cse0 0)) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)))) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)))) is different from false [2021-11-02 13:22:51,575 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 8))) (and (not (= .cse0 0)) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)) (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)))) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)))) is different from false [2021-11-02 13:22:53,597 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 8) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)))))) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 0))) is different from false [2021-11-02 13:22:55,602 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 8) 0)) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0)))) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) is different from false [2021-11-02 13:22:57,728 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 0)) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0))))) is different from false [2021-11-02 13:23:00,018 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8) 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0)) is different from false [2021-11-02 13:23:02,054 WARN L838 $PredicateComparison]: unable to prove that (and (or |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short995| (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (<= (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0) 0))) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8) 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0)) is different from false [2021-11-02 13:23:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:23:08,275 INFO L93 Difference]: Finished difference Result 465 states and 507 transitions. [2021-11-02 13:23:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-02 13:23:08,275 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.225) internal successors, (169), 40 states have internal predecessors, (169), 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 65 [2021-11-02 13:23:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:23:08,276 INFO L225 Difference]: With dead ends: 465 [2021-11-02 13:23:08,276 INFO L226 Difference]: Without dead ends: 384 [2021-11-02 13:23:08,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 31051.17ms TimeCoverageRelationStatistics Valid=344, Invalid=2145, Unknown=13, NotChecked=1404, Total=3906 [2021-11-02 13:23:08,278 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9023.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.65ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1859 IncrementalHoareTripleChecker+Unchecked, 9678.09ms IncrementalHoareTripleChecker+Time [2021-11-02 13:23:08,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 4561 Unknown, 0 Unchecked, 27.65ms Time], IncrementalHoareTripleChecker [23 Valid, 2678 Invalid, 1 Unknown, 1859 Unchecked, 9678.09ms Time] [2021-11-02 13:23:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-02 13:23:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 249. [2021-11-02 13:23:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.1188524590163935) internal successors, (273), 248 states have internal predecessors, (273), 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-02 13:23:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 273 transitions. [2021-11-02 13:23:08,291 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 273 transitions. Word has length 65 [2021-11-02 13:23:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:23:08,291 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 273 transitions. [2021-11-02 13:23:08,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.225) internal successors, (169), 40 states have internal predecessors, (169), 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-02 13:23:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 273 transitions. [2021-11-02 13:23:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 13:23:08,292 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:23:08,292 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:23:08,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-02 13:23:08,511 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,SelfDestructingSolverStorable26 [2021-11-02 13:23:08,512 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:23:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:23:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1868828167, now seen corresponding path program 1 times [2021-11-02 13:23:08,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:23:08,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48076193] [2021-11-02 13:23:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:23:08,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:23:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:23:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:23:09,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:23:09,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48076193] [2021-11-02 13:23:09,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48076193] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:23:09,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546606370] [2021-11-02 13:23:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:23:09,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:23:09,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:23:09,451 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-02 13:23:09,452 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-02 13:23:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:23:10,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 2955 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-02 13:23:10,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:23:10,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-02 13:23:10,562 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-02 13:23:10,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-02 13:23:11,280 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 13:23:11,281 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 11 treesize of output 11 [2021-11-02 13:23:11,385 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 19 treesize of output 18 [2021-11-02 13:23:11,516 INFO L354 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2021-11-02 13:23:11,517 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2021-11-02 13:23:23,318 INFO L354 Elim1Store]: treesize reduction 223, result has 38.6 percent of original size [2021-11-02 13:23:23,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 66 treesize of output 167 [2021-11-02 13:23:28,097 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 37 treesize of output 25 [2021-11-02 13:23:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:23:28,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:23:54,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~array.base Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_save_byte_from_array_~array.offset Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_11| Int)) (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse4 (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base))) (store .cse4 (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) (select (select |c_#memory_int| ULTIMATE.start_save_byte_from_array_~array.base) (+ ULTIMATE.start_save_byte_from_array_~array.offset (select .cse4 c_ULTIMATE.start_save_byte_from_array_~storage.offset)))))))) (let ((.cse3 (select .cse2 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_11|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select (select (store .cse2 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_11| (store (store .cse3 0 (+ (- 1) .cse1)) 8 v_DerPreprocessor_5)) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|))) (or (= .cse0 0) (< .cse1 (select (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) (< 0 .cse0))))))) is different from false [2021-11-02 13:23:56,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset Int) (|ULTIMATE.start_nondet_size_t_#res| Int) (ULTIMATE.start_save_byte_from_array_~array.base Int) (v_DerPreprocessor_5 Int) (ULTIMATE.start_save_byte_from_array_~array.offset Int) (|v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_11| Int)) (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse4 (store (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset |ULTIMATE.start_nondet_size_t_#res|))) (store .cse4 (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) (select (select (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base .cse4) ULTIMATE.start_save_byte_from_array_~array.base) (+ ULTIMATE.start_save_byte_from_array_~array.offset |ULTIMATE.start_nondet_size_t_#res|))))))) (let ((.cse3 (select .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_11|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select (select (store .cse1 |v_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base_11| (store (store .cse3 0 (+ (- 1) .cse0)) 8 v_DerPreprocessor_5)) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|))) (or (< .cse0 (select (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) (= .cse2 0) (< 0 .cse2))))))) is different from false [2021-11-02 13:23:58,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:23:58,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 16675 treesize of output 15271 [2021-11-02 13:23:58,523 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-02 13:23:58,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 13:23:58,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-02 13:23:58,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440485327] [2021-11-02 13:23:58,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 13:23:58,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:23:58,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 13:23:58,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=929, Unknown=14, NotChecked=126, Total=1190 [2021-11-02 13:23:58,524 INFO L87 Difference]: Start difference. First operand 249 states and 273 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02 13:24:01,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:24:04,180 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2021-11-02 13:24:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:24:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 65 [2021-11-02 13:24:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:24:04,181 INFO L225 Difference]: With dead ends: 325 [2021-11-02 13:24:04,181 INFO L226 Difference]: Without dead ends: 242 [2021-11-02 13:24:04,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 39608.78ms TimeCoverageRelationStatistics Valid=203, Invalid=1273, Unknown=14, NotChecked=150, Total=1640 [2021-11-02 13:24:04,182 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 407 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4557.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.59ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5006.08ms IncrementalHoareTripleChecker+Time [2021-11-02 13:24:04,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 0 Invalid, 844 Unknown, 0 Unchecked, 5.59ms Time], IncrementalHoareTripleChecker [47 Valid, 796 Invalid, 1 Unknown, 0 Unchecked, 5006.08ms Time] [2021-11-02 13:24:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-02 13:24:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2021-11-02 13:24:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.1144067796610169) internal successors, (263), 239 states have internal predecessors, (263), 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-02 13:24:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2021-11-02 13:24:04,192 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 65 [2021-11-02 13:24:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:24:04,192 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2021-11-02 13:24:04,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02 13:24:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2021-11-02 13:24:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 13:24:04,193 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:24:04,193 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] [2021-11-02 13:24:04,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-02 13:24:04,402 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,SelfDestructingSolverStorable27 [2021-11-02 13:24:04,402 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:24:04,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:24:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1941508249, now seen corresponding path program 1 times [2021-11-02 13:24:04,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:24:04,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807276772] [2021-11-02 13:24:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:24:04,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:24:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:24:04,704 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-02 13:24:04,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:24:04,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807276772] [2021-11-02 13:24:04,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807276772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:24:04,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:24:04,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:24:04,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999392353] [2021-11-02 13:24:04,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:24:04,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:24:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:24:04,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:24:04,706 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-02 13:24:07,660 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:24:09,747 INFO L93 Difference]: Finished difference Result 294 states and 318 transitions. [2021-11-02 13:24:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:24:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2021-11-02 13:24:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:24:09,748 INFO L225 Difference]: With dead ends: 294 [2021-11-02 13:24:09,748 INFO L226 Difference]: Without dead ends: 256 [2021-11-02 13:24:09,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 282.55ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:24:09,749 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4408.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.30ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4855.35ms IncrementalHoareTripleChecker+Time [2021-11-02 13:24:09,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 680 Unknown, 0 Unchecked, 3.30ms Time], IncrementalHoareTripleChecker [20 Valid, 659 Invalid, 1 Unknown, 0 Unchecked, 4855.35ms Time] [2021-11-02 13:24:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-02 13:24:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 204. [2021-11-02 13:24:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.125) internal successors, (225), 203 states have internal predecessors, (225), 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-02 13:24:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2021-11-02 13:24:09,760 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 69 [2021-11-02 13:24:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:24:09,760 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2021-11-02 13:24:09,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-02 13:24:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2021-11-02 13:24:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 13:24:09,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:24:09,761 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] [2021-11-02 13:24:09,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 13:24:09,761 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:24:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:24:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash 656368198, now seen corresponding path program 1 times [2021-11-02 13:24:09,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:24:09,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903970714] [2021-11-02 13:24:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:24:09,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:24:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:24:10,178 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-02 13:24:10,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:24:10,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903970714] [2021-11-02 13:24:10,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903970714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:24:10,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:24:10,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:24:10,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625593627] [2021-11-02 13:24:10,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:24:10,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:24:10,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:24:10,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:24:10,180 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-02 13:24:12,928 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:24:15,607 INFO L93 Difference]: Finished difference Result 372 states and 406 transitions. [2021-11-02 13:24:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:24:15,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 69 [2021-11-02 13:24:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:24:15,608 INFO L225 Difference]: With dead ends: 372 [2021-11-02 13:24:15,609 INFO L226 Difference]: Without dead ends: 294 [2021-11-02 13:24:15,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 410.39ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:24:15,610 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4709.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.40ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5171.09ms IncrementalHoareTripleChecker+Time [2021-11-02 13:24:15,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 4.40ms Time], IncrementalHoareTripleChecker [18 Valid, 884 Invalid, 1 Unknown, 0 Unchecked, 5171.09ms Time] [2021-11-02 13:24:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-02 13:24:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 204. [2021-11-02 13:24:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.12) internal successors, (224), 203 states have internal predecessors, (224), 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-02 13:24:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 224 transitions. [2021-11-02 13:24:15,621 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 224 transitions. Word has length 69 [2021-11-02 13:24:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:24:15,622 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 224 transitions. [2021-11-02 13:24:15,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-02 13:24:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 224 transitions. [2021-11-02 13:24:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-02 13:24:15,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:24:15,623 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:24:15,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-02 13:24:15,623 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:24:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:24:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1738419711, now seen corresponding path program 1 times [2021-11-02 13:24:15,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:24:15,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585193435] [2021-11-02 13:24:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:24:15,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:24:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:24:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:24:16,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:24:16,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585193435] [2021-11-02 13:24:16,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585193435] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:24:16,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431848071] [2021-11-02 13:24:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:24:16,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:24:16,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:24:16,973 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-02 13:24:16,974 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-02 13:24:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:24:17,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 2979 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-02 13:24:17,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:24:17,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-02 13:24:18,013 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-02 13:24:18,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-02 13:24:19,084 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-02 13:24:19,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-02 13:24:19,215 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 20 treesize of output 19 [2021-11-02 13:24:19,340 INFO L354 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2021-11-02 13:24:19,341 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 44 [2021-11-02 13:24:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:24:31,086 INFO L354 Elim1Store]: treesize reduction 243, result has 37.2 percent of original size [2021-11-02 13:24:31,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 60 treesize of output 169 [2021-11-02 13:24:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:24:33,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:24:36,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|))) (store .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)))) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|) v_DerPreprocessor_6))) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| .cse0) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset) 0)) (= (select .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|) 0)))) is different from false [2021-11-02 13:24:38,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|))) (store .cse1 0 (+ (- 1) (select .cse1 0)))) 8 v_DerPreprocessor_6))) (or (= (select .cse0 0) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| .cse0) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset) 0))))) is different from false [2021-11-02 13:24:40,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|))) (store .cse1 0 (+ (- 1) (select .cse1 0)))) 8 v_DerPreprocessor_6))) (or (= (select .cse0 0) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| .cse0) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|) 0))))) is different from false [2021-11-02 13:24:42,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_6 Int) (ULTIMATE.start_save_byte_from_array_~array.base Int) (ULTIMATE.start_save_byte_from_array_~array.offset Int)) (let ((.cse1 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse3 (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base))) (store .cse3 (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) (select (select |c_#memory_int| ULTIMATE.start_save_byte_from_array_~array.base) (+ ULTIMATE.start_save_byte_from_array_~array.offset (select .cse3 c_ULTIMATE.start_save_byte_from_array_~storage.offset)))))))) (let ((.cse0 (store (let ((.cse2 (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|))) (store .cse2 0 (+ (- 1) (select .cse2 0)))) 8 v_DerPreprocessor_6))) (or (= (select .cse0 0) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| .cse0) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|) 0)))))) is different from false [2021-11-02 13:24:44,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (|ULTIMATE.start_nondet_size_t_#res| Int) (v_DerPreprocessor_6 Int) (ULTIMATE.start_save_byte_from_array_~array.base Int) (ULTIMATE.start_save_byte_from_array_~array.offset Int)) (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse3 (store (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset |ULTIMATE.start_nondet_size_t_#res|))) (store .cse3 (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) (select (select (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base .cse3) ULTIMATE.start_save_byte_from_array_~array.base) (+ ULTIMATE.start_save_byte_from_array_~array.offset |ULTIMATE.start_nondet_size_t_#res|))))))) (let ((.cse1 (store (let ((.cse2 (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|))) (store .cse2 0 (+ (- 1) (select .cse2 0)))) 8 v_DerPreprocessor_6))) (or (not (= (select (select (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| .cse1) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|) 0)) (= (select .cse1 0) 0))))) is different from false [2021-11-02 13:24:47,380 INFO L354 Elim1Store]: treesize reduction 430, result has 43.3 percent of original size [2021-11-02 13:24:47,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 14649 treesize of output 13525 [2021-11-02 13:24:47,708 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:24:47,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 16577 treesize of output 15251 [2021-11-02 13:24:47,971 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:24:47,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 15251 treesize of output 15303 [2021-11-02 13:25:25,265 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 14 treesize of output 8 [2021-11-02 13:25:27,473 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 14 treesize of output 8 [2021-11-02 13:25:30,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:25:30,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-11-02 13:25:30,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:25:30,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-11-02 13:25:30,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:25:30,982 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:25:30,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 47 [2021-11-02 13:25:31,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:25:31,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-11-02 13:25:40,532 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:25:40,533 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 23 treesize of output 27 [2021-11-02 13:25:41,115 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 6 Killed by 15