./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f 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_left_trim_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 df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 09:13:51,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 09:13:51,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 09:13:52,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 09:13:52,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 09:13:52,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 09:13:52,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 09:13:52,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 09:13:52,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 09:13:52,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 09:13:52,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 09:13:52,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 09:13:52,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 09:13:52,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 09:13:52,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 09:13:52,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 09:13:52,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 09:13:52,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 09:13:52,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 09:13:52,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 09:13:52,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 09:13:52,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 09:13:52,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 09:13:52,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 09:13:52,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 09:13:52,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 09:13:52,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 09:13:52,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 09:13:52,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 09:13:52,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 09:13:52,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 09:13:52,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 09:13:52,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 09:13:52,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 09:13:52,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 09:13:52,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 09:13:52,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 09:13:52,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 09:13:52,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 09:13:52,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 09:13:52,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 09:13:52,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 09:13:52,074 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 09:13:52,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 09:13:52,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 09:13:52,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 09:13:52,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 09:13:52,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 09:13:52,077 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 09:13:52,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 09:13:52,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 09:13:52,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 09:13:52,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 09:13:52,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 09:13:52,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 09:13:52,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 09:13:52,078 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 09:13:52,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 09:13:52,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 09:13:52,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 09:13:52,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 09:13:52,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 09:13:52,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 09:13:52,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 09:13:52,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 09:13:52,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 09:13:52,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 09:13:52,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 09:13:52,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 09:13:52,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 09:13:52,081 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 09:13:52,081 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 -> df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 [2021-11-07 09:13:52,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 09:13:52,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 09:13:52,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 09:13:52,324 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 09:13:52,325 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 09:13:52,326 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_left_trim_pred_harness.i [2021-11-07 09:13:52,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5528e9c/f60135d0551049bc91cdbfac7a887d41/FLAGe6d939753 [2021-11-07 09:13:53,027 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 09:13:53,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-07 09:13:53,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5528e9c/f60135d0551049bc91cdbfac7a887d41/FLAGe6d939753 [2021-11-07 09:13:53,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5528e9c/f60135d0551049bc91cdbfac7a887d41 [2021-11-07 09:13:53,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 09:13:53,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 09:13:53,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 09:13:53,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 09:13:53,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 09:13:53,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:53" (1/1) ... [2021-11-07 09:13:53,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3015157d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:53, skipping insertion in model container [2021-11-07 09:13:53,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:53" (1/1) ... [2021-11-07 09:13:53,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 09:13:53,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 09:13:53,481 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_left_trim_pred_harness.i[4504,4517] [2021-11-07 09:13:53,486 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_left_trim_pred_harness.i[4564,4577] [2021-11-07 09:13:53,501 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-07 09:13:53,507 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-07 09:13:53,952 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,953 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,953 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,954 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,955 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,962 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,963 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,964 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:53,965 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,192 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-07 09:13:54,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-07 09:13:54,193 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-07 09:13:54,194 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-07 09:13:54,195 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-07 09:13:54,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-07 09:13:54,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-07 09:13:54,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-07 09:13:54,197 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-07 09:13:54,197 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-07 09:13:54,290 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-07 09:13:54,343 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,343 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 09:13:54,433 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 09:13:54,450 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_left_trim_pred_harness.i[4504,4517] [2021-11-07 09:13:54,452 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_left_trim_pred_harness.i[4564,4577] [2021-11-07 09:13:54,454 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-07 09:13:54,455 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-07 09:13:54,483 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,483 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,483 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,484 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,485 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,496 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,497 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,499 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,499 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,532 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-07 09:13:54,533 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-07 09:13:54,533 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-07 09:13:54,534 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-07 09:13:54,534 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-07 09:13:54,535 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-07 09:13:54,535 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-07 09:13:54,536 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-07 09:13:54,536 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-07 09:13:54,538 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-07 09:13:54,552 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-07 09:13:54,597 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,598 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:13:54,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 09:13:54,758 INFO L208 MainTranslator]: Completed translation [2021-11-07 09:13:54,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54 WrapperNode [2021-11-07 09:13:54,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 09:13:54,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 09:13:54,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 09:13:54,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 09:13:54,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 09:13:54,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 09:13:54,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 09:13:54,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 09:13:54,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 09:13:54,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 09:13:54,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 09:13:54,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 09:13:54,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (1/1) ... [2021-11-07 09:13:54,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 09:13:55,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:13:55,029 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-07 09:13:55,046 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-07 09:13:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 09:13:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 09:13:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 09:13:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 09:13:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 09:13:55,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 09:13:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 09:13:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 09:13:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 09:13:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 09:13:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 09:14:02,236 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 09:14:02,236 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-11-07 09:14:02,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:14:02 BoogieIcfgContainer [2021-11-07 09:14:02,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 09:14:02,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 09:14:02,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 09:14:02,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 09:14:02,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:13:53" (1/3) ... [2021-11-07 09:14:02,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6598e292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:14:02, skipping insertion in model container [2021-11-07 09:14:02,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:54" (2/3) ... [2021-11-07 09:14:02,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6598e292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:14:02, skipping insertion in model container [2021-11-07 09:14:02,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:14:02" (3/3) ... [2021-11-07 09:14:02,243 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_left_trim_pred_harness.i [2021-11-07 09:14:02,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 09:14:02,247 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-07 09:14:02,276 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 09:14:02,281 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-07 09:14:02,281 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-07 09:14:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 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-07 09:14:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 09:14:02,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:02,301 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-07 09:14:02,302 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-07 09:14:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-07 09:14:02,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:02,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055391639] [2021-11-07 09:14:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:02,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:02,799 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-07 09:14:02,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:02,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055391639] [2021-11-07 09:14:02,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055391639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:02,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:02,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 09:14:02,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67243523] [2021-11-07 09:14:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:02,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 09:14:02,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 09:14:02,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 09:14:02,835 INFO L87 Difference]: Start difference. First operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 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-07 09:14:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:02,870 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2021-11-07 09:14:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 09:14:02,873 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-07 09:14:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:02,881 INFO L225 Difference]: With dead ends: 244 [2021-11-07 09:14:02,882 INFO L226 Difference]: Without dead ends: 117 [2021-11-07 09:14:02,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 09:14:02,891 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.36ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:02,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 4.36ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 09:14:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-07 09:14:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-07 09:14:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 116 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:14:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2021-11-07 09:14:02,928 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 30 [2021-11-07 09:14:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:02,929 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2021-11-07 09:14:02,929 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-07 09:14:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2021-11-07 09:14:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 09:14:02,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:02,934 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-07 09:14:02,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 09:14:02,936 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-07 09:14:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-07 09:14:02,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:02,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187864965] [2021-11-07 09:14:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:02,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:03,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-07 09:14:03,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:03,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187864965] [2021-11-07 09:14:03,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187864965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:03,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:03,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:14:03,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703238469] [2021-11-07 09:14:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:03,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:14:03,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:14:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:14:03,209 INFO L87 Difference]: Start difference. First operand 117 states and 150 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-07 09:14:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:03,402 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2021-11-07 09:14:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 09:14:03,404 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-07 09:14:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:03,405 INFO L225 Difference]: With dead ends: 213 [2021-11-07 09:14:03,405 INFO L226 Difference]: Without dead ends: 117 [2021-11-07 09:14:03,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.21ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:14:03,406 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.31ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 145.25ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:03,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 188 Invalid, 39 Unknown, 0 Unchecked, 3.31ms Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 145.25ms Time] [2021-11-07 09:14:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-07 09:14:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-07 09:14:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3125) internal successors, (147), 116 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-07 09:14:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-11-07 09:14:03,415 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 32 [2021-11-07 09:14:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:03,415 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-11-07 09:14:03,416 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-07 09:14:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-11-07 09:14:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 09:14:03,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:03,417 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-07 09:14:03,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 09:14:03,417 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-07 09:14:03,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-07 09:14:03,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:03,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673929380] [2021-11-07 09:14:03,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:03,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:03,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-07 09:14:03,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:03,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673929380] [2021-11-07 09:14:03,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673929380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:03,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:03,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 09:14:03,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512627108] [2021-11-07 09:14:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:03,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 09:14:03,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 09:14:03,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:14:03,655 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-07 09:14:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:03,847 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2021-11-07 09:14:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 09:14:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-07 09:14:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:03,849 INFO L225 Difference]: With dead ends: 174 [2021-11-07 09:14:03,849 INFO L226 Difference]: Without dead ends: 117 [2021-11-07 09:14:03,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 105.44ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:14:03,850 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 297 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.40ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 115.62ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:03,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 214 Invalid, 43 Unknown, 0 Unchecked, 2.40ms Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 115.62ms Time] [2021-11-07 09:14:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-07 09:14:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-07 09:14:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:14:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-11-07 09:14:03,856 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 36 [2021-11-07 09:14:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:03,856 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-11-07 09:14:03,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-07 09:14:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-11-07 09:14:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 09:14:03,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:03,857 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-07 09:14:03,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 09:14:03,858 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-07 09:14:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-07 09:14:03,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:03,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434987081] [2021-11-07 09:14:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:03,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:04,283 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-07 09:14:04,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:04,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434987081] [2021-11-07 09:14:04,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434987081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:04,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:04,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 09:14:04,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455515204] [2021-11-07 09:14:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:04,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 09:14:04,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 09:14:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:14:04,285 INFO L87 Difference]: Start difference. First operand 117 states and 146 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-07 09:14:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:04,899 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2021-11-07 09:14:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:14:04,899 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-07 09:14:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:04,900 INFO L225 Difference]: With dead ends: 216 [2021-11-07 09:14:04,900 INFO L226 Difference]: Without dead ends: 208 [2021-11-07 09:14:04,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 200.13ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:14:04,901 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 176 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 434.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.37ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 470.71ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:04,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 570 Invalid, 226 Unknown, 0 Unchecked, 4.37ms Time], IncrementalHoareTripleChecker [51 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 470.71ms Time] [2021-11-07 09:14:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-07 09:14:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2021-11-07 09:14:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.265625) internal successors, (162), 132 states have internal predecessors, (162), 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-07 09:14:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-11-07 09:14:04,909 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2021-11-07 09:14:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:04,909 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-11-07 09:14:04,909 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-07 09:14:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-11-07 09:14:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 09:14:04,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:04,910 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-07 09:14:04,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 09:14:04,910 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-07 09:14:04,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-07 09:14:04,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:04,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105985090] [2021-11-07 09:14:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:04,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:05,534 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-07 09:14:05,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:05,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105985090] [2021-11-07 09:14:05,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105985090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:05,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:05,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:14:05,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014954368] [2021-11-07 09:14:05,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:05,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:14:05,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:05,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:14:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:14:05,536 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-07 09:14:07,586 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-07 09:14:09,666 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-07 09:14:11,772 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:13,770 INFO L93 Difference]: Finished difference Result 399 states and 482 transitions. [2021-11-07 09:14:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 09:14:13,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-07 09:14:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:13,773 INFO L225 Difference]: With dead ends: 399 [2021-11-07 09:14:13,773 INFO L226 Difference]: Without dead ends: 292 [2021-11-07 09:14:13,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 842.67ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-07 09:14:13,774 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 532 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 40 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7079.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.06ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7476.37ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:13,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 701 Invalid, 434 Unknown, 0 Unchecked, 10.06ms Time], IncrementalHoareTripleChecker [40 Valid, 391 Invalid, 3 Unknown, 0 Unchecked, 7476.37ms Time] [2021-11-07 09:14:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-07 09:14:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-07 09:14:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 206 states have internal predecessors, (251), 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-07 09:14:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-11-07 09:14:13,809 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 42 [2021-11-07 09:14:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:13,810 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-11-07 09:14:13,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-07 09:14:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-11-07 09:14:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 09:14:13,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:13,815 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-07 09:14:13,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 09:14:13,816 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-07 09:14:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-07 09:14:13,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:13,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202841778] [2021-11-07 09:14:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:13,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:14,236 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-07 09:14:14,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:14,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202841778] [2021-11-07 09:14:14,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202841778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:14,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:14,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:14:14,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062593272] [2021-11-07 09:14:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:14,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:14:14,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:14,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:14:14,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:14:14,239 INFO L87 Difference]: Start difference. First operand 207 states and 251 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-07 09:14:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:14,386 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-11-07 09:14:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 09:14:14,386 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-07 09:14:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:14,387 INFO L225 Difference]: With dead ends: 264 [2021-11-07 09:14:14,388 INFO L226 Difference]: Without dead ends: 207 [2021-11-07 09:14:14,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:14:14,388 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.10ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 111.63ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:14,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 286 Invalid, 35 Unknown, 0 Unchecked, 1.10ms Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 111.63ms Time] [2021-11-07 09:14:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-07 09:14:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-07 09:14:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 206 states have internal predecessors, (249), 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-07 09:14:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2021-11-07 09:14:14,404 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 43 [2021-11-07 09:14:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:14,404 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2021-11-07 09:14:14,405 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-07 09:14:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2021-11-07 09:14:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 09:14:14,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:14,406 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-07 09:14:14,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 09:14:14,406 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-07 09:14:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-07 09:14:14,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:14,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562325967] [2021-11-07 09:14:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:14,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:14,557 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-07 09:14:14,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:14,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562325967] [2021-11-07 09:14:14,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562325967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:14,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:14,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 09:14:14,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749250462] [2021-11-07 09:14:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:14,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 09:14:14,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 09:14:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 09:14:14,560 INFO L87 Difference]: Start difference. First operand 207 states and 249 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-07 09:14:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:14,603 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2021-11-07 09:14:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 09:14:14,604 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-07 09:14:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:14,607 INFO L225 Difference]: With dead ends: 298 [2021-11-07 09:14:14,607 INFO L226 Difference]: Without dead ends: 210 [2021-11-07 09:14:14,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.70ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 09:14:14,611 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.15ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:14,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.31ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 35.15ms Time] [2021-11-07 09:14:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-07 09:14:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-07 09:14:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 209 states have internal predecessors, (252), 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-07 09:14:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2021-11-07 09:14:14,621 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 45 [2021-11-07 09:14:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:14,622 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2021-11-07 09:14:14,622 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-07 09:14:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2021-11-07 09:14:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 09:14:14,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:14,623 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-07 09:14:14,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 09:14:14,624 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-07 09:14:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-07 09:14:14,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:14,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722442602] [2021-11-07 09:14:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:14,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:15,105 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-07 09:14:15,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:15,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722442602] [2021-11-07 09:14:15,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722442602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:15,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:15,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 09:14:15,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826544152] [2021-11-07 09:14:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:15,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 09:14:15,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 09:14:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 09:14:15,107 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-07 09:14:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:15,721 INFO L93 Difference]: Finished difference Result 433 states and 511 transitions. [2021-11-07 09:14:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 09:14:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-07 09:14:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:15,724 INFO L225 Difference]: With dead ends: 433 [2021-11-07 09:14:15,724 INFO L226 Difference]: Without dead ends: 262 [2021-11-07 09:14:15,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 190.34ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:14:15,725 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 84 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 484.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.54ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 517.64ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:15,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 275 Unknown, 0 Unchecked, 3.54ms Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 517.64ms Time] [2021-11-07 09:14:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-07 09:14:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 210. [2021-11-07 09:14:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 209 states have internal predecessors, (250), 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-07 09:14:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2021-11-07 09:14:15,730 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 46 [2021-11-07 09:14:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:15,730 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2021-11-07 09:14:15,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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-07 09:14:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2021-11-07 09:14:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 09:14:15,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:15,731 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-07 09:14:15,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 09:14:15,731 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-07 09:14:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-07 09:14:15,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:15,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565600017] [2021-11-07 09:14:15,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:15,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:16,227 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-07 09:14:16,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:16,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565600017] [2021-11-07 09:14:16,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565600017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:16,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:16,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 09:14:16,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435229811] [2021-11-07 09:14:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:16,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 09:14:16,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 09:14:16,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 09:14:16,229 INFO L87 Difference]: Start difference. First operand 210 states and 250 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-07 09:14:18,271 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-07 09:14:20,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:21,365 INFO L93 Difference]: Finished difference Result 408 states and 486 transitions. [2021-11-07 09:14:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 09:14:21,366 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-07 09:14:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:21,367 INFO L225 Difference]: With dead ends: 408 [2021-11-07 09:14:21,367 INFO L226 Difference]: Without dead ends: 272 [2021-11-07 09:14:21,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 303.54ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:14:21,368 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 382 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4609.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.63ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4883.35ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:21,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 467 Invalid, 223 Unknown, 0 Unchecked, 4.63ms Time], IncrementalHoareTripleChecker [23 Valid, 198 Invalid, 2 Unknown, 0 Unchecked, 4883.35ms Time] [2021-11-07 09:14:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-07 09:14:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 204. [2021-11-07 09:14:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.2060301507537687) internal successors, (240), 203 states have internal predecessors, (240), 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-07 09:14:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2021-11-07 09:14:21,374 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 47 [2021-11-07 09:14:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:21,374 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2021-11-07 09:14:21,374 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-07 09:14:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2021-11-07 09:14:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 09:14:21,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:21,374 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] [2021-11-07 09:14:21,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 09:14:21,375 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-07 09:14:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash 93394749, now seen corresponding path program 1 times [2021-11-07 09:14:21,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:21,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750537294] [2021-11-07 09:14:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:21,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:21,739 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-07 09:14:21,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:21,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750537294] [2021-11-07 09:14:21,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750537294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:21,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:21,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 09:14:21,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746791334] [2021-11-07 09:14:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:21,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 09:14:21,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:21,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 09:14:21,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:14:21,740 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-07 09:14:23,787 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:24,633 INFO L93 Difference]: Finished difference Result 394 states and 463 transitions. [2021-11-07 09:14:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 09:14:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 48 [2021-11-07 09:14:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:24,635 INFO L225 Difference]: With dead ends: 394 [2021-11-07 09:14:24,635 INFO L226 Difference]: Without dead ends: 230 [2021-11-07 09:14:24,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 80.07ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:14:24,636 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 190 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2540.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.79ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2842.09ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:24,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 279 Invalid, 197 Unknown, 0 Unchecked, 3.79ms Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 1 Unknown, 0 Unchecked, 2842.09ms Time] [2021-11-07 09:14:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-07 09:14:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2021-11-07 09:14:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.1658291457286432) internal successors, (232), 203 states have internal predecessors, (232), 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-07 09:14:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2021-11-07 09:14:24,641 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 48 [2021-11-07 09:14:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:24,642 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2021-11-07 09:14:24,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-07 09:14:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2021-11-07 09:14:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 09:14:24,642 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:24,642 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] [2021-11-07 09:14:24,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 09:14:24,642 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:14:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2144378747, now seen corresponding path program 1 times [2021-11-07 09:14:24,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:24,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829407586] [2021-11-07 09:14:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:24,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:25,155 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-07 09:14:25,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:25,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829407586] [2021-11-07 09:14:25,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829407586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:25,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:25,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:14:25,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701131514] [2021-11-07 09:14:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:25,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:14:25,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:14:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:14:25,157 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-07 09:14:27,201 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-07 09:14:29,316 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:31,433 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-07 09:14:33,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:35,234 INFO L93 Difference]: Finished difference Result 536 states and 610 transitions. [2021-11-07 09:14:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 09:14:35,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 48 [2021-11-07 09:14:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:35,238 INFO L225 Difference]: With dead ends: 536 [2021-11-07 09:14:35,238 INFO L226 Difference]: Without dead ends: 472 [2021-11-07 09:14:35,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 669.01ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-07 09:14:35,239 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 886 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9010.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.12ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9524.55ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:35,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 436 Invalid, 360 Unknown, 0 Unchecked, 7.12ms Time], IncrementalHoareTripleChecker [46 Valid, 310 Invalid, 4 Unknown, 0 Unchecked, 9524.55ms Time] [2021-11-07 09:14:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-07 09:14:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 181. [2021-11-07 09:14:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.1647727272727273) internal successors, (205), 180 states have internal predecessors, (205), 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-07 09:14:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2021-11-07 09:14:35,250 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 48 [2021-11-07 09:14:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:35,251 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2021-11-07 09:14:35,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-07 09:14:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2021-11-07 09:14:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 09:14:35,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:35,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:14:35,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 09:14:35,252 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:14:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-07 09:14:35,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:35,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580805672] [2021-11-07 09:14:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:35,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:35,591 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-07 09:14:35,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:35,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580805672] [2021-11-07 09:14:35,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580805672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:35,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:35,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:14:35,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794790602] [2021-11-07 09:14:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:35,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:14:35,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:14:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:14:35,593 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-07 09:14:37,636 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-07 09:14:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:38,217 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2021-11-07 09:14:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 09:14:38,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-07 09:14:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:38,218 INFO L225 Difference]: With dead ends: 338 [2021-11-07 09:14:38,218 INFO L226 Difference]: Without dead ends: 181 [2021-11-07 09:14:38,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 95.50ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:14:38,219 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2407.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2566.73ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:38,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 145 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 2566.73ms Time] [2021-11-07 09:14:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-07 09:14:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-07 09:14:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.125) internal successors, (198), 180 states have internal predecessors, (198), 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-07 09:14:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2021-11-07 09:14:38,228 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 49 [2021-11-07 09:14:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:38,229 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2021-11-07 09:14:38,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-07 09:14:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2021-11-07 09:14:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 09:14:38,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:38,229 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-07 09:14:38,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 09:14:38,230 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:14:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 190279064, now seen corresponding path program 1 times [2021-11-07 09:14:38,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:38,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082329292] [2021-11-07 09:14:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:38,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:38,825 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-07 09:14:38,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:38,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082329292] [2021-11-07 09:14:38,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082329292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:38,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:38,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 09:14:38,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569726477] [2021-11-07 09:14:38,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:38,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 09:14:38,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 09:14:38,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:14:38,827 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-07 09:14:40,869 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-07 09:14:42,997 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-07 09:14:45,115 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-07 09:14:47,230 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:49,392 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2021-11-07 09:14:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 09:14:49,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-07 09:14:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:49,394 INFO L225 Difference]: With dead ends: 310 [2021-11-07 09:14:49,395 INFO L226 Difference]: Without dead ends: 265 [2021-11-07 09:14:49,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1025.42ms TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-11-07 09:14:49,396 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 441 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9161.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.44ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9715.11ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:49,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 602 Invalid, 456 Unknown, 0 Unchecked, 5.44ms Time], IncrementalHoareTripleChecker [50 Valid, 402 Invalid, 4 Unknown, 0 Unchecked, 9715.11ms Time] [2021-11-07 09:14:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-07 09:14:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 201. [2021-11-07 09:14:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.1122448979591837) internal successors, (218), 200 states have internal predecessors, (218), 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-07 09:14:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2021-11-07 09:14:49,402 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 49 [2021-11-07 09:14:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:49,402 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2021-11-07 09:14:49,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-07 09:14:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2021-11-07 09:14:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 09:14:49,403 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:49,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, 1, 1, 1, 1] [2021-11-07 09:14:49,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 09:14:49,404 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-07 09:14:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1409745750, now seen corresponding path program 1 times [2021-11-07 09:14:49,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:49,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452779721] [2021-11-07 09:14:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:49,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:14:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:14:49,954 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-07 09:14:49,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:14:49,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452779721] [2021-11-07 09:14:49,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452779721] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:14:49,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:14:49,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:14:49,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253149899] [2021-11-07 09:14:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:14:49,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:14:49,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:14:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:14:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:14:49,955 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-07 09:14:52,012 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-07 09:14:54,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:56,242 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-07 09:14:58,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:14:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:14:59,850 INFO L93 Difference]: Finished difference Result 566 states and 618 transitions. [2021-11-07 09:14:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 09:14:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-07 09:14:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:14:59,852 INFO L225 Difference]: With dead ends: 566 [2021-11-07 09:14:59,852 INFO L226 Difference]: Without dead ends: 482 [2021-11-07 09:14:59,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 515.67ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-07 09:14:59,853 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 774 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 21 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8974.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9499.06ms IncrementalHoareTripleChecker+Time [2021-11-07 09:14:59,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 665 Invalid, 357 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [21 Valid, 332 Invalid, 4 Unknown, 0 Unchecked, 9499.06ms Time] [2021-11-07 09:14:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-11-07 09:14:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 203. [2021-11-07 09:14:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 202 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:14:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2021-11-07 09:14:59,863 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 54 [2021-11-07 09:14:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:14:59,863 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2021-11-07 09:14:59,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-07 09:14:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2021-11-07 09:14:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-07 09:14:59,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:14:59,864 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] [2021-11-07 09:14:59,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 09:14:59,865 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:14:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:14:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937159, now seen corresponding path program 1 times [2021-11-07 09:14:59,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:14:59,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394817169] [2021-11-07 09:14:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:14:59,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:00,480 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-07 09:15:00,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:00,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394817169] [2021-11-07 09:15:00,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394817169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:00,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:00,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:15:00,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667644179] [2021-11-07 09:15:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:00,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:15:00,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:15:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:15:00,482 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-07 09:15:02,523 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-07 09:15:04,670 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:15:06,795 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-07 09:15:08,877 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-07 09:15:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:15:11,015 INFO L93 Difference]: Finished difference Result 502 states and 544 transitions. [2021-11-07 09:15:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 09:15:11,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 55 [2021-11-07 09:15:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:15:11,017 INFO L225 Difference]: With dead ends: 502 [2021-11-07 09:15:11,017 INFO L226 Difference]: Without dead ends: 457 [2021-11-07 09:15:11,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 867.64ms TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-07 09:15:11,018 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 585 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9246.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.65ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9786.27ms IncrementalHoareTripleChecker+Time [2021-11-07 09:15:11,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 562 Invalid, 453 Unknown, 0 Unchecked, 5.65ms Time], IncrementalHoareTripleChecker [50 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 9786.27ms Time] [2021-11-07 09:15:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-07 09:15:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 173. [2021-11-07 09:15:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 172 states have internal predecessors, (187), 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-07 09:15:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2021-11-07 09:15:11,024 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 55 [2021-11-07 09:15:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:15:11,024 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2021-11-07 09:15:11,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-07 09:15:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2021-11-07 09:15:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-07 09:15:11,025 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:15:11,025 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-07 09:15:11,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 09:15:11,026 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:15:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:15:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-07 09:15:11,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:15:11,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237687193] [2021-11-07 09:15:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:15:11,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:13,311 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-07 09:15:13,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:13,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237687193] [2021-11-07 09:15:13,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237687193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:13,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:13,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:15:13,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840585600] [2021-11-07 09:15:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:13,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:15:13,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:15:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:15:13,312 INFO L87 Difference]: Start difference. First operand 173 states and 187 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-07 09:15:15,373 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-07 09:15:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:15:16,509 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2021-11-07 09:15:16,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:15:16,510 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-07 09:15:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:15:16,511 INFO L225 Difference]: With dead ends: 393 [2021-11-07 09:15:16,511 INFO L226 Difference]: Without dead ends: 243 [2021-11-07 09:15:16,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 545.62ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:15:16,512 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 293 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2720.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.88ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2895.82ms IncrementalHoareTripleChecker+Time [2021-11-07 09:15:16,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 536 Invalid, 253 Unknown, 0 Unchecked, 2.88ms Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 2895.82ms Time] [2021-11-07 09:15:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-07 09:15:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 177. [2021-11-07 09:15:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1104651162790697) internal successors, (191), 176 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:15:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2021-11-07 09:15:16,533 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 56 [2021-11-07 09:15:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:15:16,533 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2021-11-07 09:15:16,534 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-07 09:15:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2021-11-07 09:15:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 09:15:16,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:15:16,536 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] [2021-11-07 09:15:16,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 09:15:16,537 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:15:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:15:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1309942923, now seen corresponding path program 1 times [2021-11-07 09:15:16,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:15:16,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249763330] [2021-11-07 09:15:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:15:16,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:16,718 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-07 09:15:16,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:16,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249763330] [2021-11-07 09:15:16,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249763330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:16,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:16,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:15:16,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893134916] [2021-11-07 09:15:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:16,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:15:16,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:16,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:15:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:15:16,719 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-07 09:15:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:15:16,802 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2021-11-07 09:15:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 09:15:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2021-11-07 09:15:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:15:16,803 INFO L225 Difference]: With dead ends: 188 [2021-11-07 09:15:16,804 INFO L226 Difference]: Without dead ends: 177 [2021-11-07 09:15:16,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:15:16,804 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 116 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.35ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.38ms IncrementalHoareTripleChecker+Time [2021-11-07 09:15:16,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 212 Invalid, 26 Unknown, 0 Unchecked, 0.35ms Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 57.38ms Time] [2021-11-07 09:15:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-07 09:15:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-07 09:15:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1046511627906976) internal successors, (190), 176 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:15:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2021-11-07 09:15:16,809 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 58 [2021-11-07 09:15:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:15:16,810 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2021-11-07 09:15:16,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-07 09:15:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2021-11-07 09:15:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 09:15:16,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:15:16,810 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-07 09:15:16,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 09:15:16,810 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-07 09:15:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:15:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-07 09:15:16,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:15:16,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723545109] [2021-11-07 09:15:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:15:16,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:20,051 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-07 09:15:20,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:20,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723545109] [2021-11-07 09:15:20,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723545109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:20,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:20,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 09:15:20,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577969238] [2021-11-07 09:15:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:20,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 09:15:20,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 09:15:20,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:15:20,053 INFO L87 Difference]: Start difference. First operand 177 states and 190 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-07 09:15:22,100 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:15:24,242 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-07 09:15:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:15:26,809 INFO L93 Difference]: Finished difference Result 435 states and 460 transitions. [2021-11-07 09:15:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 09:15:26,810 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-07 09:15:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:15:26,811 INFO L225 Difference]: With dead ends: 435 [2021-11-07 09:15:26,811 INFO L226 Difference]: Without dead ends: 300 [2021-11-07 09:15:26,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1357.08ms TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-11-07 09:15:26,812 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 590 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5500.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.96ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5862.63ms IncrementalHoareTripleChecker+Time [2021-11-07 09:15:26,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 1245 Invalid, 565 Unknown, 0 Unchecked, 7.96ms Time], IncrementalHoareTripleChecker [11 Valid, 552 Invalid, 2 Unknown, 0 Unchecked, 5862.63ms Time] [2021-11-07 09:15:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-07 09:15:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 177. [2021-11-07 09:15:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 176 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:15:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2021-11-07 09:15:26,819 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 59 [2021-11-07 09:15:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:15:26,819 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2021-11-07 09:15:26,819 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-07 09:15:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2021-11-07 09:15:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 09:15:26,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:15:26,820 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-07 09:15:26,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 09:15:26,820 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-07 09:15:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:15:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-07 09:15:26,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:15:26,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560393934] [2021-11-07 09:15:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:15:26,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:31,120 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-07 09:15:31,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:31,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560393934] [2021-11-07 09:15:31,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560393934] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:31,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:31,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 09:15:31,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550092376] [2021-11-07 09:15:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:31,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 09:15:31,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 09:15:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-07 09:15:31,121 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07 09:15:33,163 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-07 09:15:35,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:15:37,404 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-07 09:15:39,534 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-07 09:15:41,656 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-07 09:15:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:15:44,518 INFO L93 Difference]: Finished difference Result 371 states and 396 transitions. [2021-11-07 09:15:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-07 09:15:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07 09:15:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:15:44,519 INFO L225 Difference]: With dead ends: 371 [2021-11-07 09:15:44,519 INFO L226 Difference]: Without dead ends: 300 [2021-11-07 09:15:44,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1930.12ms TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 09:15:44,520 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 637 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 63 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11312.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.98ms SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11994.32ms IncrementalHoareTripleChecker+Time [2021-11-07 09:15:44,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1155 Invalid, 601 Unknown, 0 Unchecked, 5.98ms Time], IncrementalHoareTripleChecker [63 Valid, 533 Invalid, 5 Unknown, 0 Unchecked, 11994.32ms Time] [2021-11-07 09:15:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-07 09:15:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 221. [2021-11-07 09:15:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 220 states have internal predecessors, (240), 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-07 09:15:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2021-11-07 09:15:44,528 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 62 [2021-11-07 09:15:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:15:44,528 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2021-11-07 09:15:44,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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-07 09:15:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2021-11-07 09:15:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 09:15:44,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:15:44,529 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-07 09:15:44,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 09:15:44,529 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:15:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:15:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1831062709, now seen corresponding path program 1 times [2021-11-07 09:15:44,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:15:44,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752062100] [2021-11-07 09:15:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:15:44,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:45,110 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-07 09:15:45,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:45,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752062100] [2021-11-07 09:15:45,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752062100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:45,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:45,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 09:15:45,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72329152] [2021-11-07 09:15:45,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:45,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 09:15:45,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:45,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 09:15:45,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:15:45,112 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-07 09:15:47,163 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:15:49,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:15:51,384 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-07 09:15:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:15:52,534 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2021-11-07 09:15:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 09:15:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-07 09:15:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:15:52,535 INFO L225 Difference]: With dead ends: 278 [2021-11-07 09:15:52,535 INFO L226 Difference]: Without dead ends: 268 [2021-11-07 09:15:52,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 755.00ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:15:52,536 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 66 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6473.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6843.01ms IncrementalHoareTripleChecker+Time [2021-11-07 09:15:52,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 471 Invalid, 178 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 6843.01ms Time] [2021-11-07 09:15:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-07 09:15:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2021-11-07 09:15:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 265 states have internal predecessors, (286), 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-07 09:15:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2021-11-07 09:15:52,547 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 64 [2021-11-07 09:15:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:15:52,547 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2021-11-07 09:15:52,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-07 09:15:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2021-11-07 09:15:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 09:15:52,548 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:15:52,548 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-07 09:15:52,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 09:15:52,549 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:15:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:15:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2002093992, now seen corresponding path program 1 times [2021-11-07 09:15:52,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:15:52,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585751449] [2021-11-07 09:15:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:15:52,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:15:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:15:53,230 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-07 09:15:53,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:15:53,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585751449] [2021-11-07 09:15:53,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585751449] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:15:53,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:15:53,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 09:15:53,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920863505] [2021-11-07 09:15:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:15:53,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 09:15:53,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:15:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 09:15:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:15:53,232 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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-07 09:15:55,279 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:15:57,418 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-07 09:15:59,514 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:16:01,640 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-07 09:16:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:16:04,574 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2021-11-07 09:16:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 09:16:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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-07 09:16:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:16:04,575 INFO L225 Difference]: With dead ends: 293 [2021-11-07 09:16:04,575 INFO L226 Difference]: Without dead ends: 233 [2021-11-07 09:16:04,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1888.20ms TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2021-11-07 09:16:04,576 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 381 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 60 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9214.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.60ms SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9741.30ms IncrementalHoareTripleChecker+Time [2021-11-07 09:16:04,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 693 Invalid, 536 Unknown, 0 Unchecked, 4.60ms Time], IncrementalHoareTripleChecker [60 Valid, 472 Invalid, 4 Unknown, 0 Unchecked, 9741.30ms Time] [2021-11-07 09:16:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-07 09:16:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2021-11-07 09:16:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.1083743842364533) internal successors, (225), 207 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-07 09:16:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2021-11-07 09:16:04,583 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 64 [2021-11-07 09:16:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:16:04,583 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2021-11-07 09:16:04,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 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-07 09:16:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2021-11-07 09:16:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 09:16:04,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:16:04,584 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-07 09:16:04,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 09:16:04,584 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-07 09:16:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:16:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-07 09:16:04,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:16:04,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234785767] [2021-11-07 09:16:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:16:04,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:16:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:16:05,117 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-07 09:16:05,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:16:05,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234785767] [2021-11-07 09:16:05,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234785767] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:16:05,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:16:05,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 09:16:05,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060251074] [2021-11-07 09:16:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:16:05,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 09:16:05,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:16:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 09:16:05,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:16:05,118 INFO L87 Difference]: Start difference. First operand 208 states and 225 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-07 09:16:07,158 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-07 09:16:09,303 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-07 09:16:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:16:12,519 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2021-11-07 09:16:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 09:16:12,520 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-07 09:16:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:16:12,521 INFO L225 Difference]: With dead ends: 325 [2021-11-07 09:16:12,521 INFO L226 Difference]: Without dead ends: 317 [2021-11-07 09:16:12,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1341.20ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-07 09:16:12,522 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 377 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 240 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5765.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.81ms SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6233.31ms IncrementalHoareTripleChecker+Time [2021-11-07 09:16:12,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 531 Invalid, 892 Unknown, 0 Unchecked, 7.81ms Time], IncrementalHoareTripleChecker [240 Valid, 650 Invalid, 2 Unknown, 0 Unchecked, 6233.31ms Time] [2021-11-07 09:16:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-07 09:16:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2021-11-07 09:16:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.1029411764705883) internal successors, (225), 208 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-07 09:16:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 225 transitions. [2021-11-07 09:16:12,530 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 225 transitions. Word has length 64 [2021-11-07 09:16:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:16:12,530 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 225 transitions. [2021-11-07 09:16:12,530 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-07 09:16:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2021-11-07 09:16:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 09:16:12,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:16:12,535 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-07 09:16:12,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 09:16:12,535 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-07 09:16:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:16:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-07 09:16:12,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:16:12,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113644726] [2021-11-07 09:16:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:16:12,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:16:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:16:16,230 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-07 09:16:16,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:16:16,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113644726] [2021-11-07 09:16:16,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113644726] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:16:16,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172543248] [2021-11-07 09:16:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:16:16,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:16:16,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:16:16,233 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-07 09:16:16,234 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-07 09:16:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:16:16,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-07 09:16:16,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:16:16,983 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-07 09:16:17,233 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 09:16:17,233 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-07 09:16:17,532 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 25 treesize of output 21 [2021-11-07 09:16:18,151 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-07 09:16:18,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-07 09:16:18,309 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 40 treesize of output 20 [2021-11-07 09:16:18,434 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-07 09:16:18,434 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 48 treesize of output 24 [2021-11-07 09:16:19,231 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-07 09:16:19,231 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 42 treesize of output 50 [2021-11-07 09:16:19,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:16:19,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:16:19,357 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 52 treesize of output 47 [2021-11-07 09:16:20,070 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:16:20,071 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 35 treesize of output 31 [2021-11-07 09:16:20,289 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-07 09:16:20,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 09:16:20,940 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-07 09:16:20,940 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 19 treesize of output 18 [2021-11-07 09:16:23,192 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-07 09:16:25,513 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-07 09:16:28,465 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_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (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_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-07 09:16:30,535 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_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)))) is different from false [2021-11-07 09:16:32,664 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 (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (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_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-07 09:16:36,929 INFO L354 Elim1Store]: treesize reduction 184, result has 32.8 percent of original size [2021-11-07 09:16:36,930 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 98744 treesize of output 64657 [2021-11-07 09:16:37,424 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:16:37,426 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 66687 treesize of output 63915 [2021-11-07 09:16:39,979 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-07 09:16:40,047 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:16:40,048 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-07 09:16:44,266 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-07 09:16:44,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172543248] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 09:16:44,267 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 09:16:44,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 20] total 42 [2021-11-07 09:16:44,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681833966] [2021-11-07 09:16:44,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 09:16:44,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-07 09:16:44,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:16:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-07 09:16:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1171, Unknown=6, NotChecked=370, Total=1722 [2021-11-07 09:16:44,269 INFO L87 Difference]: Start difference. First operand 209 states and 225 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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-07 09:16:46,311 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-07 09:16:48,438 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-07 09:16:50,557 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-07 09:16:52,703 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-07 09:16:54,845 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-07 09:16:56,928 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-07 09:16:59,085 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:17:01,191 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:17:04,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 8)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (not (= .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (not (= .cse0 0)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1) (not (= .cse1 c_ULTIMATE.start_save_byte_from_array_~storage.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 (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (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_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))))) is different from false [2021-11-07 09:17:06,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.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 (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (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_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))))) is different from false [2021-11-07 09:17:08,146 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (not (= .cse0 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_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)))) is different from false [2021-11-07 09:17:10,156 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.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_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |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_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))) (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1))) is different from false [2021-11-07 09:17:12,162 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (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) (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 1) (not (= .cse0 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (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 ((.cse1 (store (select |c_#memory_$Pointer$.base| |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_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-07 09:17:14,180 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 1) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= .cse0 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (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 ((.cse1 (store (select |c_#memory_$Pointer$.base| |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_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-07 09:17:16,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= .cse0 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 ((.cse1 (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)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0))) is different from false [2021-11-07 09:17:18,294 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= .cse0 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 ((.cse1 (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)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0) (or (and |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short995| (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (< 0 (mod (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0) 18446744073709551616)))) (and (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0) 18446744073709551616) 0)) (not |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short995|))))) is different from false [2021-11-07 09:17:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:17:19,865 INFO L93 Difference]: Finished difference Result 304 states and 327 transitions. [2021-11-07 09:17:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 09:17:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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-07 09:17:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:17:19,866 INFO L225 Difference]: With dead ends: 304 [2021-11-07 09:17:19,866 INFO L226 Difference]: Without dead ends: 230 [2021-11-07 09:17:19,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 32145.74ms TimeCoverageRelationStatistics Valid=311, Invalid=1889, Unknown=14, NotChecked=1326, Total=3540 [2021-11-07 09:17:19,868 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 152 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 20 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17299.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.56ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 18382.21ms IncrementalHoareTripleChecker+Time [2021-11-07 09:17:19,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 1423 Invalid, 1244 Unknown, 0 Unchecked, 10.56ms Time], IncrementalHoareTripleChecker [20 Valid, 488 Invalid, 8 Unknown, 728 Unchecked, 18382.21ms Time] [2021-11-07 09:17:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-07 09:17:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 202. [2021-11-07 09:17:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.095959595959596) internal successors, (217), 201 states have internal predecessors, (217), 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-07 09:17:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2021-11-07 09:17:19,881 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 65 [2021-11-07 09:17:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:17:19,882 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2021-11-07 09:17:19,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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-07 09:17:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2021-11-07 09:17:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 09:17:19,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:17:19,884 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-07 09:17:19,906 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-07 09:17:20,106 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,SelfDestructingSolverStorable22 [2021-11-07 09:17:20,107 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:17:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:17:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-07 09:17:20,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:17:20,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534530470] [2021-11-07 09:17:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:17:20,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:17:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:17:20,701 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-07 09:17:20,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:17:20,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534530470] [2021-11-07 09:17:20,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534530470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:17:20,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:17:20,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:17:20,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389805904] [2021-11-07 09:17:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:17:20,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:17:20,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:17:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:17:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:17:20,703 INFO L87 Difference]: Start difference. First operand 202 states and 217 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-07 09:17:22,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:17:25,022 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:17:27,104 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-07 09:17:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:17:28,599 INFO L93 Difference]: Finished difference Result 351 states and 375 transitions. [2021-11-07 09:17:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 09:17:28,600 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-07 09:17:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:17:28,601 INFO L225 Difference]: With dead ends: 351 [2021-11-07 09:17:28,601 INFO L226 Difference]: Without dead ends: 287 [2021-11-07 09:17:28,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 458.83ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-07 09:17:28,602 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 208 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 17 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7105.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.16ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7589.26ms IncrementalHoareTripleChecker+Time [2021-11-07 09:17:28,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 553 Invalid, 370 Unknown, 0 Unchecked, 6.16ms Time], IncrementalHoareTripleChecker [17 Valid, 350 Invalid, 3 Unknown, 0 Unchecked, 7589.26ms Time] [2021-11-07 09:17:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-07 09:17:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 202. [2021-11-07 09:17:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.0909090909090908) internal successors, (216), 201 states have internal predecessors, (216), 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-07 09:17:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2021-11-07 09:17:28,611 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 69 [2021-11-07 09:17:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:17:28,612 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2021-11-07 09:17:28,612 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-07 09:17:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2021-11-07 09:17:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 09:17:28,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:17:28,613 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-07 09:17:28,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 09:17:28,613 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:17:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:17:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1058361341, now seen corresponding path program 1 times [2021-11-07 09:17:28,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:17:28,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698653665] [2021-11-07 09:17:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:17:28,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:17:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:17:29,217 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-07 09:17:29,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:17:29,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698653665] [2021-11-07 09:17:29,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698653665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:17:29,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:17:29,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 09:17:29,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265143569] [2021-11-07 09:17:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:17:29,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 09:17:29,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:17:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 09:17:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:17:29,219 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-07 09:17:31,304 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-07 09:17:33,424 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-07 09:17:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:17:34,061 INFO L93 Difference]: Finished difference Result 288 states and 308 transitions. [2021-11-07 09:17:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 09:17:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2021-11-07 09:17:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:17:34,062 INFO L225 Difference]: With dead ends: 288 [2021-11-07 09:17:34,062 INFO L226 Difference]: Without dead ends: 224 [2021-11-07 09:17:34,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 136.01ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:17:34,063 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 47 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4470.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4763.80ms IncrementalHoareTripleChecker+Time [2021-11-07 09:17:34,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 375 Invalid, 142 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 4763.80ms Time] [2021-11-07 09:17:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-07 09:17:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-11-07 09:17:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.088785046728972) internal successors, (233), 217 states have internal predecessors, (233), 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-07 09:17:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2021-11-07 09:17:34,073 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 72 [2021-11-07 09:17:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:17:34,073 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2021-11-07 09:17:34,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-07 09:17:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2021-11-07 09:17:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-07 09:17:34,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:17:34,074 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:17:34,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 09:17:34,074 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:17:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:17:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1034320377, now seen corresponding path program 1 times [2021-11-07 09:17:34,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:17:34,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722756302] [2021-11-07 09:17:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:17:34,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:17:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:17:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 09:17:35,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:17:35,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722756302] [2021-11-07 09:17:35,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722756302] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:17:35,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425727743] [2021-11-07 09:17:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:17:35,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:17:35,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:17:35,068 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-07 09:17:35,069 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-07 09:17:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:17:35,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 2991 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-07 09:17:35,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:17:36,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 09:17:36,774 INFO L354 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-11-07 09:17:36,774 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 25 treesize of output 23 [2021-11-07 09:17:36,991 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-07 09:17:36,992 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 39 treesize of output 31 [2021-11-07 09:17:37,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:17:37,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:17:37,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:17:37,996 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 09:17:37,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2021-11-07 09:17:38,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:17:38,050 INFO L354 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2021-11-07 09:17:38,050 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 37 treesize of output 28 [2021-11-07 09:17:38,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:17:38,161 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-07 09:17:38,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2021-11-07 09:17:39,964 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:17:39,964 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 35 treesize of output 26 [2021-11-07 09:17:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 09:17:40,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 09:17:43,477 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:17:43,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 160 [2021-11-07 09:17:43,568 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 7 treesize of output 5 [2021-11-07 09:17:43,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 09:17:44,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-07 09:17:44,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:17:44,108 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 17 treesize of output 21 [2021-11-07 09:17:44,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:17:44,380 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 72 treesize of output 88 [2021-11-07 09:17:50,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:17:51,246 INFO L354 Elim1Store]: treesize reduction 268, result has 32.0 percent of original size [2021-11-07 09:17:51,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 3633 treesize of output 3565 [2021-11-07 09:17:51,406 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:17:51,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3177 treesize of output 3001 [2021-11-07 09:17:52,716 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-07 09:17:54,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:17:54,477 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:17:54,478 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 58 treesize of output 56 [2021-11-07 09:17:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 09:17:56,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425727743] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 09:17:56,698 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 09:17:56,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 48 [2021-11-07 09:17:56,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748146826] [2021-11-07 09:17:56,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 09:17:56,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-07 09:17:56,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:17:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-07 09:17:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2062, Unknown=2, NotChecked=0, Total=2256 [2021-11-07 09:17:56,700 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 48 states have internal predecessors, (205), 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-07 09:17:58,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:00,861 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:02,942 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-07 09:18:05,044 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:07,140 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:09,239 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:11,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:18:27,588 INFO L93 Difference]: Finished difference Result 405 states and 431 transitions. [2021-11-07 09:18:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-07 09:18:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 48 states have internal predecessors, (205), 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 74 [2021-11-07 09:18:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:18:27,590 INFO L225 Difference]: With dead ends: 405 [2021-11-07 09:18:27,590 INFO L226 Difference]: Without dead ends: 327 [2021-11-07 09:18:27,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2943 ImplicationChecksByTransitivity, 23709.91ms TimeCoverageRelationStatistics Valid=1441, Invalid=9062, Unknown=3, NotChecked=0, Total=10506 [2021-11-07 09:18:27,592 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 1449 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 220 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17287.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.72ms SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 18259.21ms IncrementalHoareTripleChecker+Time [2021-11-07 09:18:27,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1449 Valid, 1867 Invalid, 2022 Unknown, 0 Unchecked, 20.72ms Time], IncrementalHoareTripleChecker [220 Valid, 1334 Invalid, 7 Unknown, 461 Unchecked, 18259.21ms Time] [2021-11-07 09:18:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-07 09:18:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 218. [2021-11-07 09:18:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.0794392523364487) internal successors, (231), 217 states have internal predecessors, (231), 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-07 09:18:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2021-11-07 09:18:27,601 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 74 [2021-11-07 09:18:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:18:27,601 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2021-11-07 09:18:27,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 48 states have internal predecessors, (205), 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-07 09:18:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2021-11-07 09:18:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 09:18:27,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:18:27,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:18:27,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 09:18:27,824 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,SelfDestructingSolverStorable25 [2021-11-07 09:18:27,824 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:18:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:18:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 144726291, now seen corresponding path program 1 times [2021-11-07 09:18:27,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:18:27,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281895241] [2021-11-07 09:18:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:18:27,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:18:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:18:31,541 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-07 09:18:31,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:18:31,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281895241] [2021-11-07 09:18:31,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281895241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:18:31,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:18:31,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 09:18:31,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275053240] [2021-11-07 09:18:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:18:31,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 09:18:31,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:18:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 09:18:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:18:31,543 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:18:33,585 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-07 09:18:35,699 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:37,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:39,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:42,040 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:18:44,954 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2021-11-07 09:18:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 09:18:44,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-07 09:18:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:18:44,956 INFO L225 Difference]: With dead ends: 292 [2021-11-07 09:18:44,956 INFO L226 Difference]: Without dead ends: 245 [2021-11-07 09:18:44,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1889.96ms TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2021-11-07 09:18:44,957 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 343 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 27 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11403.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.41ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12035.54ms IncrementalHoareTripleChecker+Time [2021-11-07 09:18:44,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 995 Invalid, 588 Unknown, 0 Unchecked, 6.41ms Time], IncrementalHoareTripleChecker [27 Valid, 556 Invalid, 5 Unknown, 0 Unchecked, 12035.54ms Time] [2021-11-07 09:18:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-07 09:18:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2021-11-07 09:18:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.0717703349282297) internal successors, (224), 212 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-07 09:18:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 224 transitions. [2021-11-07 09:18:44,966 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 224 transitions. Word has length 75 [2021-11-07 09:18:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:18:44,966 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 224 transitions. [2021-11-07 09:18:44,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:18:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 224 transitions. [2021-11-07 09:18:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-07 09:18:44,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:18:44,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:18:44,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 09:18:44,967 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:18:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:18:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1442971818, now seen corresponding path program 1 times [2021-11-07 09:18:44,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:18:44,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130395940] [2021-11-07 09:18:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:18:44,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:18:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:18:45,570 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-07 09:18:45,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:18:45,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130395940] [2021-11-07 09:18:45,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130395940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:18:45,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:18:45,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:18:45,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981373723] [2021-11-07 09:18:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:18:45,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:18:45,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:18:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:18:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:18:45,571 INFO L87 Difference]: Start difference. First operand 213 states and 224 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-07 09:18:47,623 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:49,725 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:51,835 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:18:52,744 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-11-07 09:18:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:18:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2021-11-07 09:18:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:18:52,746 INFO L225 Difference]: With dead ends: 243 [2021-11-07 09:18:52,746 INFO L226 Difference]: Without dead ends: 230 [2021-11-07 09:18:52,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 446.38ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-07 09:18:52,747 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 253 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6503.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.74ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6865.20ms IncrementalHoareTripleChecker+Time [2021-11-07 09:18:52,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 478 Invalid, 172 Unknown, 0 Unchecked, 1.74ms Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 6865.20ms Time] [2021-11-07 09:18:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-07 09:18:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2021-11-07 09:18:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 224 states have (on average 1.0669642857142858) internal successors, (239), 227 states have internal predecessors, (239), 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-07 09:18:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 239 transitions. [2021-11-07 09:18:52,757 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 239 transitions. Word has length 76 [2021-11-07 09:18:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:18:52,757 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 239 transitions. [2021-11-07 09:18:52,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-07 09:18:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 239 transitions. [2021-11-07 09:18:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-07 09:18:52,758 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:18:52,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:18:52,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 09:18:52,758 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:18:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:18:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1271940535, now seen corresponding path program 1 times [2021-11-07 09:18:52,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:18:52,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841477004] [2021-11-07 09:18:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:18:52,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:18:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:18:53,273 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-07 09:18:53,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:18:53,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841477004] [2021-11-07 09:18:53,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841477004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:18:53,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:18:53,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:18:53,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983195601] [2021-11-07 09:18:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:18:53,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:18:53,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:18:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:18:53,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:18:53,275 INFO L87 Difference]: Start difference. First operand 228 states and 239 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-07 09:18:55,322 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:18:57,457 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-07 09:18:59,597 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-07 09:19:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:19:00,707 INFO L93 Difference]: Finished difference Result 299 states and 312 transitions. [2021-11-07 09:19:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 09:19:00,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2021-11-07 09:19:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:19:00,709 INFO L225 Difference]: With dead ends: 299 [2021-11-07 09:19:00,709 INFO L226 Difference]: Without dead ends: 233 [2021-11-07 09:19:00,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 370.59ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-07 09:19:00,714 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 111 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6718.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.29ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7150.97ms IncrementalHoareTripleChecker+Time [2021-11-07 09:19:00,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 583 Invalid, 257 Unknown, 0 Unchecked, 2.29ms Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 3 Unknown, 0 Unchecked, 7150.97ms Time] [2021-11-07 09:19:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-07 09:19:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2021-11-07 09:19:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.0821256038647342) internal successors, (224), 210 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-07 09:19:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2021-11-07 09:19:00,725 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 76 [2021-11-07 09:19:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:19:00,725 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2021-11-07 09:19:00,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-07 09:19:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2021-11-07 09:19:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-07 09:19:00,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:19:00,729 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:19:00,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 09:19:00,730 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-07 09:19:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:19:00,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1038906120, now seen corresponding path program 1 times [2021-11-07 09:19:00,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:19:00,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175982872] [2021-11-07 09:19:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:19:00,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:19:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:19:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 09:19:05,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:19:05,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175982872] [2021-11-07 09:19:05,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175982872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:19:05,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:19:05,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 09:19:05,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446088743] [2021-11-07 09:19:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:19:05,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 09:19:05,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:19:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 09:19:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-07 09:19:05,170 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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-07 09:19:07,212 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-07 09:19:09,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:19:11,447 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-07 09:19:13,554 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:19:15,626 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-07 09:19:17,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:19:19,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:19:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:19:23,196 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2021-11-07 09:19:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 09:19:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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 80 [2021-11-07 09:19:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:19:23,197 INFO L225 Difference]: With dead ends: 262 [2021-11-07 09:19:23,197 INFO L226 Difference]: Without dead ends: 200 [2021-11-07 09:19:23,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2863.47ms TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 09:19:23,198 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 503 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 68 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14937.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.52ms SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15769.90ms IncrementalHoareTripleChecker+Time [2021-11-07 09:19:23,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 382 Invalid, 422 Unknown, 0 Unchecked, 4.52ms Time], IncrementalHoareTripleChecker [68 Valid, 347 Invalid, 7 Unknown, 0 Unchecked, 15769.90ms Time] [2021-11-07 09:19:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-07 09:19:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 156. [2021-11-07 09:19:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.051948051948052) internal successors, (162), 155 states have internal predecessors, (162), 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-07 09:19:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2021-11-07 09:19:23,206 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 80 [2021-11-07 09:19:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:19:23,206 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2021-11-07 09:19:23,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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-07 09:19:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2021-11-07 09:19:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 09:19:23,207 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:19:23,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:19:23,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 09:19:23,208 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:19:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:19:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2124225498, now seen corresponding path program 1 times [2021-11-07 09:19:23,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:19:23,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757682507] [2021-11-07 09:19:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:19:23,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:19:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:19:24,037 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-07 09:19:24,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:19:24,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757682507] [2021-11-07 09:19:24,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757682507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:19:24,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:19:24,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:19:24,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21938968] [2021-11-07 09:19:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:19:24,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:19:24,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:19:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:19:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:19:24,038 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-07 09:19:26,080 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-07 09:19:28,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:19:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:19:29,144 INFO L93 Difference]: Finished difference Result 230 states and 240 transitions. [2021-11-07 09:19:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 09:19:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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 90 [2021-11-07 09:19:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:19:29,145 INFO L225 Difference]: With dead ends: 230 [2021-11-07 09:19:29,145 INFO L226 Difference]: Without dead ends: 186 [2021-11-07 09:19:29,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 466.54ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-07 09:19:29,146 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 272 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4603.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.21ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4864.86ms IncrementalHoareTripleChecker+Time [2021-11-07 09:19:29,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 356 Invalid, 237 Unknown, 0 Unchecked, 2.21ms Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 2 Unknown, 0 Unchecked, 4864.86ms Time] [2021-11-07 09:19:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-07 09:19:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2021-11-07 09:19:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 174 states have internal predecessors, (182), 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-07 09:19:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2021-11-07 09:19:29,154 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 90 [2021-11-07 09:19:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:19:29,154 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2021-11-07 09:19:29,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-07 09:19:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2021-11-07 09:19:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-07 09:19:29,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:19:29,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:19:29,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 09:19:29,155 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:19:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:19:29,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1518276033, now seen corresponding path program 1 times [2021-11-07 09:19:29,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:19:29,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273245113] [2021-11-07 09:19:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:19:29,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:19:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:19:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 09:19:30,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:19:30,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273245113] [2021-11-07 09:19:30,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273245113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:19:30,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:19:30,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:19:30,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205492320] [2021-11-07 09:19:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:19:30,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:19:30,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:19:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:19:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:19:30,102 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-07 09:19:32,144 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-07 09:19:34,270 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-07 09:19:36,398 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-07 09:19:38,515 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:19:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:19:39,621 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2021-11-07 09:19:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 09:19:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-07 09:19:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:19:39,622 INFO L225 Difference]: With dead ends: 212 [2021-11-07 09:19:39,622 INFO L226 Difference]: Without dead ends: 175 [2021-11-07 09:19:39,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 473.99ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-07 09:19:39,623 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 199 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8646.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.85ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9199.13ms IncrementalHoareTripleChecker+Time [2021-11-07 09:19:39,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 261 Invalid, 244 Unknown, 0 Unchecked, 2.85ms Time], IncrementalHoareTripleChecker [20 Valid, 220 Invalid, 4 Unknown, 0 Unchecked, 9199.13ms Time] [2021-11-07 09:19:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-07 09:19:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-07 09:19:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0404624277456647) internal successors, (180), 174 states have internal predecessors, (180), 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-07 09:19:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 180 transitions. [2021-11-07 09:19:39,631 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 180 transitions. Word has length 93 [2021-11-07 09:19:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:19:39,631 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 180 transitions. [2021-11-07 09:19:39,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-07 09:19:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 180 transitions. [2021-11-07 09:19:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-07 09:19:39,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:19:39,632 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, 1, 1, 1, 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-07 09:19:39,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 09:19:39,633 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:19:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:19:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash -616554032, now seen corresponding path program 1 times [2021-11-07 09:19:39,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:19:39,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46341782] [2021-11-07 09:19:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:19:39,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:19:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:20:00,538 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-07 09:20:00,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:20:00,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46341782] [2021-11-07 09:20:00,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46341782] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:20:00,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295479317] [2021-11-07 09:20:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:20:00,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:20:00,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:20:00,540 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-07 09:20:00,541 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-07 09:24:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:24:26,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 3095 conjuncts, 179 conjunts are in the unsatisfiable core [2021-11-07 09:24:26,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:24:26,849 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-07 09:24:27,623 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 09:24:27,624 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-07 09:24:28,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-07 09:24:28,286 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 27 treesize of output 23 [2021-11-07 09:24:28,321 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 11 treesize of output 7 [2021-11-07 09:24:29,832 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-07 09:24:29,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 43 [2021-11-07 09:24:30,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:24:30,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2021-11-07 09:24:30,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2021-11-07 09:24:30,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:24:30,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-11-07 09:24:31,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:24:31,620 INFO L354 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2021-11-07 09:24:31,620 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 29 treesize of output 17 [2021-11-07 09:24:31,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:24:31,699 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-07 09:24:31,700 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 146 treesize of output 118 [2021-11-07 09:24:31,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:31,855 INFO L354 Elim1Store]: treesize reduction 272, result has 16.3 percent of original size [2021-11-07 09:24:31,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 163 [2021-11-07 09:24:31,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:31,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:31,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:31,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:31,991 INFO L354 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2021-11-07 09:24:31,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 84 [2021-11-07 09:24:33,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:33,149 INFO L354 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2021-11-07 09:24:33,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 61 [2021-11-07 09:24:36,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:36,971 INFO L354 Elim1Store]: treesize reduction 60, result has 17.8 percent of original size [2021-11-07 09:24:36,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 63 [2021-11-07 09:24:38,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 136 [2021-11-07 09:24:38,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 126 [2021-11-07 09:24:38,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:38,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:38,236 INFO L354 Elim1Store]: treesize reduction 193, result has 6.3 percent of original size [2021-11-07 09:24:38,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 144 treesize of output 132 [2021-11-07 09:24:38,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-11-07 09:24:38,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:38,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:24:38,406 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 29 treesize of output 28 [2021-11-07 09:24:45,430 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base] [2021-11-07 09:24:45,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 09:24:45,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-07 09:24:45,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593066886] [2021-11-07 09:24:45,431 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-07 09:24:45,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-07 09:24:45,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:24:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-07 09:24:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2295, Unknown=1, NotChecked=0, Total=2450 [2021-11-07 09:24:45,433 INFO L87 Difference]: Start difference. First operand 175 states and 180 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 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-07 09:24:47,475 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-07 09:24:49,606 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-07 09:24:51,798 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:24:53,920 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-07 09:24:56,025 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:24:58,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:00,301 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-07 09:25:02,469 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-07 09:25:04,584 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:06,761 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:08,916 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:11,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:13,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:15,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:17,555 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:19,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:21,857 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-07 09:25:24,003 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-07 09:26:10,146 WARN L227 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 278 DAG size of output: 226 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 09:26:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:13,097 INFO L93 Difference]: Finished difference Result 266 states and 273 transitions. [2021-11-07 09:26:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 09:26:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 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 99 [2021-11-07 09:26:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:13,099 INFO L225 Difference]: With dead ends: 266 [2021-11-07 09:26:13,099 INFO L226 Difference]: Without dead ends: 218 [2021-11-07 09:26:13,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 57039.81ms TimeCoverageRelationStatistics Valid=529, Invalid=4872, Unknown=1, NotChecked=0, Total=5402 [2021-11-07 09:26:13,100 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 792 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 109 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42112.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.92ms SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45135.16ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:13,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 1466 Invalid, 1597 Unknown, 0 Unchecked, 15.92ms Time], IncrementalHoareTripleChecker [109 Valid, 1470 Invalid, 18 Unknown, 0 Unchecked, 45135.16ms Time] [2021-11-07 09:26:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-07 09:26:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 177. [2021-11-07 09:26:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.04) internal successors, (182), 176 states have internal predecessors, (182), 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-07 09:26:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 182 transitions. [2021-11-07 09:26:13,113 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 182 transitions. Word has length 99 [2021-11-07 09:26:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:13,113 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 182 transitions. [2021-11-07 09:26:13,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 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-07 09:26:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 182 transitions. [2021-11-07 09:26:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-07 09:26:13,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:13,123 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:26:13,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-07 09:26:13,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:26:13,340 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -771712428, now seen corresponding path program 1 times [2021-11-07 09:26:13,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:13,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173772229] [2021-11-07 09:26:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:13,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 09:26:14,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:14,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173772229] [2021-11-07 09:26:14,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173772229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:14,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:14,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:26:14,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479104586] [2021-11-07 09:26:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:14,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:26:14,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:26:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:26:14,153 INFO L87 Difference]: Start difference. First operand 177 states and 182 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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-07 09:26:16,196 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-07 09:26:18,322 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-07 09:26:20,451 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-07 09:26:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:21,487 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2021-11-07 09:26:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 09:26:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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 101 [2021-11-07 09:26:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:21,488 INFO L225 Difference]: With dead ends: 232 [2021-11-07 09:26:21,488 INFO L226 Difference]: Without dead ends: 188 [2021-11-07 09:26:21,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 347.18ms TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-11-07 09:26:21,489 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 161 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6690.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.74ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7146.77ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:21,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 500 Invalid, 247 Unknown, 0 Unchecked, 2.74ms Time], IncrementalHoareTripleChecker [8 Valid, 236 Invalid, 3 Unknown, 0 Unchecked, 7146.77ms Time] [2021-11-07 09:26:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-07 09:26:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 161. [2021-11-07 09:26:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0377358490566038) internal successors, (165), 160 states have internal predecessors, (165), 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-07 09:26:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2021-11-07 09:26:21,500 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 101 [2021-11-07 09:26:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:21,501 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2021-11-07 09:26:21,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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-07 09:26:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2021-11-07 09:26:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-07 09:26:21,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:21,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:26:21,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 09:26:21,502 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 836506168, now seen corresponding path program 1 times [2021-11-07 09:26:21,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:21,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587643564] [2021-11-07 09:26:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:21,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:22,414 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-07 09:26:22,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:22,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587643564] [2021-11-07 09:26:22,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587643564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:22,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:22,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 09:26:22,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966951443] [2021-11-07 09:26:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:22,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 09:26:22,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 09:26:22,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:26:22,416 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-07 09:26:24,460 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-07 09:26:26,598 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-07 09:26:28,723 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-07 09:26:30,840 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-07 09:26:32,995 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:26:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:34,854 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2021-11-07 09:26:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 09:26:34,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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 102 [2021-11-07 09:26:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:34,855 INFO L225 Difference]: With dead ends: 239 [2021-11-07 09:26:34,855 INFO L226 Difference]: Without dead ends: 229 [2021-11-07 09:26:34,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 995.50ms TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-11-07 09:26:34,856 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 361 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 27 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10985.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.42ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11706.54ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:34,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 533 Invalid, 381 Unknown, 0 Unchecked, 4.42ms Time], IncrementalHoareTripleChecker [27 Valid, 349 Invalid, 5 Unknown, 0 Unchecked, 11706.54ms Time] [2021-11-07 09:26:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-07 09:26:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 204. [2021-11-07 09:26:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 202 states have (on average 1.0297029702970297) internal successors, (208), 203 states have internal predecessors, (208), 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-07 09:26:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2021-11-07 09:26:34,870 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 102 [2021-11-07 09:26:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:34,870 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2021-11-07 09:26:34,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-07 09:26:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2021-11-07 09:26:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-07 09:26:34,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:34,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:26:34,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 09:26:34,883 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1007537451, now seen corresponding path program 1 times [2021-11-07 09:26:34,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:34,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344339177] [2021-11-07 09:26:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:34,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:38,243 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-07 09:26:38,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:38,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344339177] [2021-11-07 09:26:38,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344339177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:38,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:38,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-07 09:26:38,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844100232] [2021-11-07 09:26:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:38,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 09:26:38,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 09:26:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-07 09:26:38,244 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 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-07 09:26:40,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:26:42,555 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:26:44,696 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-07 09:26:46,815 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-07 09:26:49,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:26:51,146 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-07 09:26:53,265 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-07 09:26:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:57,425 INFO L93 Difference]: Finished difference Result 228 states and 231 transitions. [2021-11-07 09:26:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 09:26:57,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 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 102 [2021-11-07 09:26:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:57,426 INFO L225 Difference]: With dead ends: 228 [2021-11-07 09:26:57,426 INFO L226 Difference]: Without dead ends: 215 [2021-11-07 09:26:57,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3293.64ms TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 09:26:57,427 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 741 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 77 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15409.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.95ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16545.04ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:57,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 590 Invalid, 615 Unknown, 0 Unchecked, 6.95ms Time], IncrementalHoareTripleChecker [77 Valid, 531 Invalid, 7 Unknown, 0 Unchecked, 16545.04ms Time] [2021-11-07 09:26:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-07 09:26:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2021-11-07 09:26:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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-07 09:26:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2021-11-07 09:26:57,445 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 102 [2021-11-07 09:26:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:57,445 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2021-11-07 09:26:57,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 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-07 09:26:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2021-11-07 09:26:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-07 09:26:57,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:57,446 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:26:57,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 09:26:57,446 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash 642444485, now seen corresponding path program 2 times [2021-11-07 09:26:57,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:57,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149617947] [2021-11-07 09:26:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:57,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:27:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:27:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 09:27:10,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:27:10,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149617947] [2021-11-07 09:27:10,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149617947] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:27:10,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641538151] [2021-11-07 09:27:10,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 09:27:10,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:27:10,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:27:10,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 09:27:10,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Killed by 15