./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_satisfies_pred_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 21e14c4abf3c8c626ff1e4d64bac7246a96ab8c19ab8b6f263006a7e1f8fc191 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 09:24:37,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 09:24:37,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 09:24:37,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 09:24:37,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 09:24:37,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 09:24:37,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 09:24:37,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 09:24:37,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 09:24:37,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 09:24:37,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 09:24:37,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 09:24:37,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 09:24:37,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 09:24:37,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 09:24:37,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 09:24:37,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 09:24:37,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 09:24:37,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 09:24:37,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 09:24:37,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 09:24:37,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 09:24:37,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 09:24:37,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 09:24:37,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 09:24:37,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 09:24:37,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 09:24:37,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 09:24:37,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 09:24:37,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 09:24:37,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 09:24:37,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 09:24:37,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 09:24:37,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 09:24:37,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 09:24:37,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 09:24:37,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 09:24:37,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 09:24:37,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 09:24:37,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 09:24:37,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 09:24:37,818 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:24:37,852 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 09:24:37,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 09:24:37,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 09:24:37,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 09:24:37,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 09:24:37,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 09:24:37,855 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 09:24:37,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 09:24:37,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 09:24:37,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 09:24:37,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 09:24:37,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 09:24:37,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 09:24:37,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 09:24:37,857 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 09:24:37,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 09:24:37,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 09:24:37,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 09:24:37,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 09:24:37,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 09:24:37,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 09:24:37,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 09:24:37,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 09:24:37,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 09:24:37,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 09:24:37,859 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 09:24:37,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 09:24:37,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 09:24:37,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 09:24:37,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21e14c4abf3c8c626ff1e4d64bac7246a96ab8c19ab8b6f263006a7e1f8fc191 [2021-11-07 09:24:38,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 09:24:38,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 09:24:38,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 09:24:38,087 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 09:24:38,088 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 09:24:38,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i [2021-11-07 09:24:38,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cce94b6/1abfa1ad09b041c78110cb75a3b1faaf/FLAGf0d417765 [2021-11-07 09:24:38,877 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 09:24:38,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i [2021-11-07 09:24:38,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cce94b6/1abfa1ad09b041c78110cb75a3b1faaf/FLAGf0d417765 [2021-11-07 09:24:38,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17cce94b6/1abfa1ad09b041c78110cb75a3b1faaf [2021-11-07 09:24:38,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 09:24:38,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 09:24:38,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 09:24:38,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 09:24:38,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 09:24:38,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:24:38" (1/1) ... [2021-11-07 09:24:39,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153dc62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:38, skipping insertion in model container [2021-11-07 09:24:39,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:24:38" (1/1) ... [2021-11-07 09:24:39,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 09:24:39,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 09:24:39,314 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i[4504,4517] [2021-11-07 09:24:39,320 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i[4564,4577] [2021-11-07 09:24:39,338 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-07 09:24:39,344 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-07 09:24:39,904 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,905 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,906 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,906 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,907 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,920 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,920 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,922 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:39,923 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,150 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-07 09:24:40,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-07 09:24:40,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-07 09:24:40,153 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-07 09:24:40,155 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-07 09:24:40,155 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-07 09:24:40,156 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-07 09:24:40,156 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-07 09:24:40,157 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-07 09:24:40,157 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-07 09:24:40,292 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-07 09:24:40,367 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,368 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 09:24:40,446 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 09:24:40,457 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i[4504,4517] [2021-11-07 09:24:40,458 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_satisfies_pred_harness.i[4564,4577] [2021-11-07 09:24:40,459 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-07 09:24:40,460 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-07 09:24:40,515 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,515 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,516 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,516 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,516 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,521 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,523 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,562 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-07 09:24:40,562 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-07 09:24:40,563 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-07 09:24:40,563 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-07 09:24:40,564 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-07 09:24:40,564 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-07 09:24:40,565 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-07 09:24:40,566 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-07 09:24:40,566 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-07 09:24:40,569 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-07 09:24:40,594 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-07 09:24:40,640 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,641 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 09:24:40,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 09:24:40,905 INFO L208 MainTranslator]: Completed translation [2021-11-07 09:24:40,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40 WrapperNode [2021-11-07 09:24:40,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 09:24:40,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 09:24:40,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 09:24:40,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 09:24:40,914 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:24:40" (1/1) ... [2021-11-07 09:24:41,010 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:24:40" (1/1) ... [2021-11-07 09:24:41,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 09:24:41,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 09:24:41,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 09:24:41,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 09:24:41,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 09:24:41,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 09:24:41,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 09:24:41,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 09:24:41,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (1/1) ... [2021-11-07 09:24:41,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 09:24:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:24:41,263 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:24:41,289 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:24:41,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 09:24:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 09:24:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 09:24:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 09:24:41,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 09:24:41,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 09:24:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 09:24:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 09:24:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 09:24:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 09:24:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 09:24:49,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 09:24:49,336 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2021-11-07 09:24:49,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:24:49 BoogieIcfgContainer [2021-11-07 09:24:49,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 09:24:49,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 09:24:49,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 09:24:49,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 09:24:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:24:38" (1/3) ... [2021-11-07 09:24:49,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e66f1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:24:49, skipping insertion in model container [2021-11-07 09:24:49,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:24:40" (2/3) ... [2021-11-07 09:24:49,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e66f1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:24:49, skipping insertion in model container [2021-11-07 09:24:49,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:24:49" (3/3) ... [2021-11-07 09:24:49,345 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_satisfies_pred_harness.i [2021-11-07 09:24:49,349 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 09:24:49,350 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-07 09:24:49,388 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 09:24:49,394 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:24:49,395 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-07 09:24:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 124 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 09:24:49,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:24:49,415 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:24:49,415 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:24:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:24:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-07 09:24:49,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:24:49,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346777603] [2021-11-07 09:24:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:24:49,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:24:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:24:49,953 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:24:49,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:24:49,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346777603] [2021-11-07 09:24:49,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346777603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:24:49,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:24:49,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 09:24:49,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625138106] [2021-11-07 09:24:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:24:49,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 09:24:49,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:24:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 09:24:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 09:24:49,991 INFO L87 Difference]: Start difference. First operand has 125 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 124 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:24:50,030 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2021-11-07 09:24:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 09:24:50,032 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:24:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:24:50,042 INFO L225 Difference]: With dead ends: 246 [2021-11-07 09:24:50,043 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 09:24:50,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 09:24:50,052 INFO L933 BasicCegarLoop]: 160 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, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 09:24:50,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 5.02ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 09:24:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 09:24:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-07 09:24:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.336283185840708) internal successors, (151), 117 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2021-11-07 09:24:50,092 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 30 [2021-11-07 09:24:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:24:50,093 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2021-11-07 09:24:50,094 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:24:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2021-11-07 09:24:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 09:24:50,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:24:50,100 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:24:50,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 09:24:50,101 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:24:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:24:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-07 09:24:50,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:24:50,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830671450] [2021-11-07 09:24:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:24:50,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:24:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:24:50,420 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:24:50,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:24:50,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830671450] [2021-11-07 09:24:50,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830671450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:24:50,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:24:50,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:24:50,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719891732] [2021-11-07 09:24:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:24:50,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:24:50,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:24:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:24:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:24:50,423 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:24:50,582 INFO L93 Difference]: Finished difference Result 215 states and 275 transitions. [2021-11-07 09:24:50,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 09:24:50,583 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:24:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:24:50,584 INFO L225 Difference]: With dead ends: 215 [2021-11-07 09:24:50,584 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 09:24:50,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.83ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:24:50,586 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 135 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 124.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.38ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 137.65ms IncrementalHoareTripleChecker+Time [2021-11-07 09:24:50,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 189 Invalid, 40 Unknown, 0 Unchecked, 3.38ms Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 137.65ms Time] [2021-11-07 09:24:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 09:24:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-07 09:24:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 117 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2021-11-07 09:24:50,594 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 32 [2021-11-07 09:24:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:24:50,594 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2021-11-07 09:24:50,595 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:24:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2021-11-07 09:24:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 09:24:50,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:24:50,596 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:24:50,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 09:24:50,596 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:24:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:24:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-07 09:24:50,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:24:50,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285493504] [2021-11-07 09:24:50,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:24:50,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:24:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:24:51,083 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:24:51,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:24:51,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285493504] [2021-11-07 09:24:51,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285493504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:24:51,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:24:51,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 09:24:51,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434529235] [2021-11-07 09:24:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:24:51,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 09:24:51,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:24:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 09:24:51,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 09:24:51,085 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:24:51,404 INFO L93 Difference]: Finished difference Result 176 states and 219 transitions. [2021-11-07 09:24:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 09:24:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 09:24:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:24:51,406 INFO L225 Difference]: With dead ends: 176 [2021-11-07 09:24:51,406 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 09:24:51,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 270.55ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:24:51,408 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.53ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 169.19ms IncrementalHoareTripleChecker+Time [2021-11-07 09:24:51,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 218 Invalid, 45 Unknown, 0 Unchecked, 3.53ms Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 169.19ms Time] [2021-11-07 09:24:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 09:24:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-07 09:24:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 117 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2021-11-07 09:24:51,414 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 36 [2021-11-07 09:24:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:24:51,414 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2021-11-07 09:24:51,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2021-11-07 09:24:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 09:24:51,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:24:51,416 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:24:51,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 09:24:51,417 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:24:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:24:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-07 09:24:51,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:24:51,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634643156] [2021-11-07 09:24:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:24:51,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:24:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:24:52,146 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:24:52,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:24:52,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634643156] [2021-11-07 09:24:52,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634643156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:24:52,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:24:52,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 09:24:52,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650743425] [2021-11-07 09:24:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:24:52,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 09:24:52,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:24:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 09:24:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:24:52,148 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:24:53,150 INFO L93 Difference]: Finished difference Result 218 states and 263 transitions. [2021-11-07 09:24:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:24:53,150 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:24:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:24:53,152 INFO L225 Difference]: With dead ends: 218 [2021-11-07 09:24:53,152 INFO L226 Difference]: Without dead ends: 210 [2021-11-07 09:24:53,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 310.16ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:24:53,153 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 167 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 710.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.45ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 788.71ms IncrementalHoareTripleChecker+Time [2021-11-07 09:24:53,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 602 Invalid, 239 Unknown, 0 Unchecked, 6.45ms Time], IncrementalHoareTripleChecker [44 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 788.71ms Time] [2021-11-07 09:24:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-07 09:24:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 134. [2021-11-07 09:24:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:24:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2021-11-07 09:24:53,164 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 38 [2021-11-07 09:24:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:24:53,165 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2021-11-07 09:24:53,165 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:24:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2021-11-07 09:24:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 09:24:53,166 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:24:53,166 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:24:53,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 09:24:53,167 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:24:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:24:53,168 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-07 09:24:53,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:24:53,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249053104] [2021-11-07 09:24:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:24:53,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:24:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:24:54,045 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:24:54,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:24:54,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249053104] [2021-11-07 09:24:54,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249053104] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:24:54,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:24:54,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:24:54,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914177997] [2021-11-07 09:24:54,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:24:54,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:24:54,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:24:54,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:24:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:24:54,048 INFO L87 Difference]: Start difference. First operand 134 states and 163 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:24:56,118 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:24:58,192 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:25:00,314 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:25:02,440 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:25:04,637 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:25:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:07,178 INFO L93 Difference]: Finished difference Result 403 states and 486 transitions. [2021-11-07 09:25:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 09:25:07,179 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:25:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:07,181 INFO L225 Difference]: With dead ends: 403 [2021-11-07 09:25:07,181 INFO L226 Difference]: Without dead ends: 295 [2021-11-07 09:25:07,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1022.10ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-07 09:25:07,183 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 482 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 37 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11636.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.83ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12297.26ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:07,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 802 Invalid, 482 Unknown, 0 Unchecked, 10.83ms Time], IncrementalHoareTripleChecker [37 Valid, 440 Invalid, 5 Unknown, 0 Unchecked, 12297.26ms Time] [2021-11-07 09:25:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-07 09:25:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 226. [2021-11-07 09:25:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.248868778280543) internal successors, (276), 225 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:25:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 276 transitions. [2021-11-07 09:25:07,242 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 276 transitions. Word has length 42 [2021-11-07 09:25:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:07,243 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 276 transitions. [2021-11-07 09:25:07,243 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:25:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 276 transitions. [2021-11-07 09:25:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 09:25:07,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:07,248 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:25:07,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 09:25:07,249 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:25:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-07 09:25:07,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:07,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930621377] [2021-11-07 09:25:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:07,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:07,555 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:25:07,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:07,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930621377] [2021-11-07 09:25:07,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930621377] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:07,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:07,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:25:07,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731520934] [2021-11-07 09:25:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:07,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:25:07,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:25:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:25:07,557 INFO L87 Difference]: Start difference. First operand 226 states and 276 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:25:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:07,720 INFO L93 Difference]: Finished difference Result 302 states and 367 transitions. [2021-11-07 09:25:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 09:25:07,721 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:25:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:07,722 INFO L225 Difference]: With dead ends: 302 [2021-11-07 09:25:07,722 INFO L226 Difference]: Without dead ends: 226 [2021-11-07 09:25:07,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.39ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:25:07,724 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 102 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.27ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.43ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:07,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 289 Invalid, 35 Unknown, 0 Unchecked, 1.27ms Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 122.43ms Time] [2021-11-07 09:25:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-07 09:25:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-11-07 09:25:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.239819004524887) internal successors, (274), 225 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:25:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2021-11-07 09:25:07,753 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 274 transitions. Word has length 43 [2021-11-07 09:25:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:07,754 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 274 transitions. [2021-11-07 09:25:07,754 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:25:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 274 transitions. [2021-11-07 09:25:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 09:25:07,758 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:07,758 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:25:07,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 09:25:07,759 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:25:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-07 09:25:07,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:07,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555923063] [2021-11-07 09:25:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:07,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:07,985 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:25:07,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:07,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555923063] [2021-11-07 09:25:07,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555923063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:07,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:07,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 09:25:07,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260816256] [2021-11-07 09:25:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:07,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 09:25:07,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:07,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 09:25:07,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 09:25:07,991 INFO L87 Difference]: Start difference. First operand 226 states and 274 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:25:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:08,033 INFO L93 Difference]: Finished difference Result 318 states and 387 transitions. [2021-11-07 09:25:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 09:25:08,035 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:25:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:08,039 INFO L225 Difference]: With dead ends: 318 [2021-11-07 09:25:08,039 INFO L226 Difference]: Without dead ends: 229 [2021-11-07 09:25:08,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 09:25:08,041 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.82ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:08,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 30.82ms Time] [2021-11-07 09:25:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-07 09:25:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-11-07 09:25:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2366071428571428) internal successors, (277), 228 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:25:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 277 transitions. [2021-11-07 09:25:08,065 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 277 transitions. Word has length 45 [2021-11-07 09:25:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:08,065 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 277 transitions. [2021-11-07 09:25:08,066 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:25:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 277 transitions. [2021-11-07 09:25:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 09:25:08,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:08,068 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:25:08,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 09:25:08,069 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:25:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-07 09:25:08,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:08,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127572955] [2021-11-07 09:25:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:08,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:08,753 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:25:08,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:08,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127572955] [2021-11-07 09:25:08,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127572955] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:08,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:08,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 09:25:08,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524749215] [2021-11-07 09:25:08,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:08,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 09:25:08,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:08,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 09:25:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 09:25:08,755 INFO L87 Difference]: Start difference. First operand 229 states and 277 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:25:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:09,813 INFO L93 Difference]: Finished difference Result 480 states and 571 transitions. [2021-11-07 09:25:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 09:25:09,814 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:25:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:09,815 INFO L225 Difference]: With dead ends: 480 [2021-11-07 09:25:09,815 INFO L226 Difference]: Without dead ends: 290 [2021-11-07 09:25:09,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 306.87ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:25:09,816 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 85 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 827.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.09ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 881.81ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:09,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 707 Invalid, 271 Unknown, 0 Unchecked, 6.09ms Time], IncrementalHoareTripleChecker [35 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 881.81ms Time] [2021-11-07 09:25:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-07 09:25:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 229. [2021-11-07 09:25:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2276785714285714) internal successors, (275), 228 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:25:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2021-11-07 09:25:09,826 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 275 transitions. Word has length 46 [2021-11-07 09:25:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:09,827 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 275 transitions. [2021-11-07 09:25:09,827 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:25:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 275 transitions. [2021-11-07 09:25:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 09:25:09,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:09,828 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:25:09,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 09:25:09,828 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:25:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-07 09:25:09,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:09,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851155992] [2021-11-07 09:25:09,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:09,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:10,502 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:25:10,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:10,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851155992] [2021-11-07 09:25:10,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851155992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:10,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:10,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 09:25:10,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974400656] [2021-11-07 09:25:10,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:10,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 09:25:10,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 09:25:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 09:25:10,504 INFO L87 Difference]: Start difference. First operand 229 states and 275 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:25:12,562 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:25:14,841 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:25:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:15,994 INFO L93 Difference]: Finished difference Result 447 states and 537 transitions. [2021-11-07 09:25:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 09:25:15,995 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:25:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:15,996 INFO L225 Difference]: With dead ends: 447 [2021-11-07 09:25:15,997 INFO L226 Difference]: Without dead ends: 292 [2021-11-07 09:25:15,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 411.57ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:25:15,998 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 384 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4807.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.73ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5194.01ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:15,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 472 Invalid, 223 Unknown, 0 Unchecked, 5.73ms Time], IncrementalHoareTripleChecker [23 Valid, 198 Invalid, 2 Unknown, 0 Unchecked, 5194.01ms Time] [2021-11-07 09:25:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-07 09:25:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 223. [2021-11-07 09:25:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2155963302752293) internal successors, (265), 222 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:25:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 265 transitions. [2021-11-07 09:25:16,009 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 265 transitions. Word has length 47 [2021-11-07 09:25:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:16,009 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 265 transitions. [2021-11-07 09:25:16,009 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:25:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 265 transitions. [2021-11-07 09:25:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 09:25:16,010 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:16,010 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:25:16,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 09:25:16,011 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:25:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 93394749, now seen corresponding path program 1 times [2021-11-07 09:25:16,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:16,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827011849] [2021-11-07 09:25:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:16,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 09:25:16,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:16,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827011849] [2021-11-07 09:25:16,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827011849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:16,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:16,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 09:25:16,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287103634] [2021-11-07 09:25:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:16,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 09:25:16,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 09:25:16,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:25:16,641 INFO L87 Difference]: Start difference. First operand 223 states and 265 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:25:18,717 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:25:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:19,588 INFO L93 Difference]: Finished difference Result 438 states and 520 transitions. [2021-11-07 09:25:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 09:25:19,589 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:25:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:19,590 INFO L225 Difference]: With dead ends: 438 [2021-11-07 09:25:19,590 INFO L226 Difference]: Without dead ends: 255 [2021-11-07 09:25:19,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 97.75ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:25:19,591 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 104 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2706.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.75ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2894.63ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:19,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 326 Invalid, 215 Unknown, 0 Unchecked, 3.75ms Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 1 Unknown, 0 Unchecked, 2894.63ms Time] [2021-11-07 09:25:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-07 09:25:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2021-11-07 09:25:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 222 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:25:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 256 transitions. [2021-11-07 09:25:19,601 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 256 transitions. Word has length 48 [2021-11-07 09:25:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:19,601 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 256 transitions. [2021-11-07 09:25:19,602 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:25:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 256 transitions. [2021-11-07 09:25:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 09:25:19,602 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:19,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] [2021-11-07 09:25:19,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 09:25:19,603 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:25:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2144378747, now seen corresponding path program 1 times [2021-11-07 09:25:19,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:19,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806632543] [2021-11-07 09:25:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:19,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:20,274 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:25:20,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:20,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806632543] [2021-11-07 09:25:20,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806632543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:20,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:20,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:25:20,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683111539] [2021-11-07 09:25:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:20,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:25:20,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:25:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:25:20,275 INFO L87 Difference]: Start difference. First operand 223 states and 256 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:25:22,335 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:25:24,509 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:26,645 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:28,758 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:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:30,881 INFO L93 Difference]: Finished difference Result 577 states and 661 transitions. [2021-11-07 09:25:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 09:25:30,882 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:25:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:30,884 INFO L225 Difference]: With dead ends: 577 [2021-11-07 09:25:30,884 INFO L226 Difference]: Without dead ends: 512 [2021-11-07 09:25:30,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 838.19ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-07 09:25:30,886 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 894 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9287.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.71ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9886.73ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:30,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 440 Invalid, 362 Unknown, 0 Unchecked, 7.71ms Time], IncrementalHoareTripleChecker [46 Valid, 312 Invalid, 4 Unknown, 0 Unchecked, 9886.73ms Time] [2021-11-07 09:25:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-11-07 09:25:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 200. [2021-11-07 09:25:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.1743589743589744) internal successors, (229), 199 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:25:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2021-11-07 09:25:30,904 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 48 [2021-11-07 09:25:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:30,905 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2021-11-07 09:25:30,905 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:25:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2021-11-07 09:25:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 09:25:30,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:30,906 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:25:30,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 09:25:30,906 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:25:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-07 09:25:30,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:30,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792080198] [2021-11-07 09:25:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:30,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:31,376 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:25:31,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:31,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792080198] [2021-11-07 09:25:31,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792080198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:31,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:31,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 09:25:31,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338627727] [2021-11-07 09:25:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:31,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 09:25:31,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 09:25:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 09:25:31,378 INFO L87 Difference]: Start difference. First operand 200 states and 229 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:25:33,442 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:25:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:34,050 INFO L93 Difference]: Finished difference Result 376 states and 431 transitions. [2021-11-07 09:25:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 09:25:34,051 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:25:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:34,052 INFO L225 Difference]: With dead ends: 376 [2021-11-07 09:25:34,052 INFO L226 Difference]: Without dead ends: 200 [2021-11-07 09:25:34,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 09:25:34,053 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 46 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2459.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.96ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2611.62ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:34,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 217 Invalid, 145 Unknown, 0 Unchecked, 1.96ms Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 2611.62ms Time] [2021-11-07 09:25:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-07 09:25:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-11-07 09:25:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.1333333333333333) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:25:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2021-11-07 09:25:34,061 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 49 [2021-11-07 09:25:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:34,062 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2021-11-07 09:25:34,062 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:25:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2021-11-07 09:25:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 09:25:34,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:34,063 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:25:34,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 09:25:34,063 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:25:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 190279064, now seen corresponding path program 1 times [2021-11-07 09:25:34,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:34,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335337644] [2021-11-07 09:25:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:34,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:34,889 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:25:34,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:34,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335337644] [2021-11-07 09:25:34,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335337644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:34,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:34,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 09:25:34,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583383056] [2021-11-07 09:25:34,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:34,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 09:25:34,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 09:25:34,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:25:34,891 INFO L87 Difference]: Start difference. First operand 200 states and 221 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:25:36,954 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:25:39,094 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:41,212 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:25:43,338 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:25:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:45,877 INFO L93 Difference]: Finished difference Result 314 states and 338 transitions. [2021-11-07 09:25:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 09:25:45,878 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:25:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:45,879 INFO L225 Difference]: With dead ends: 314 [2021-11-07 09:25:45,879 INFO L226 Difference]: Without dead ends: 268 [2021-11-07 09:25:45,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1228.89ms TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-11-07 09:25:45,880 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 469 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9361.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.14ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10008.93ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:45,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 604 Invalid, 458 Unknown, 0 Unchecked, 10.14ms Time], IncrementalHoareTripleChecker [50 Valid, 404 Invalid, 4 Unknown, 0 Unchecked, 10008.93ms Time] [2021-11-07 09:25:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-07 09:25:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 220. [2021-11-07 09:25:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.1209302325581396) internal successors, (241), 219 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:25:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2021-11-07 09:25:45,898 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 49 [2021-11-07 09:25:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:45,898 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2021-11-07 09:25:45,898 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:25:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2021-11-07 09:25:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 09:25:45,899 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:45,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:25:45,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 09:25:45,900 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:25:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1316272933, now seen corresponding path program 1 times [2021-11-07 09:25:45,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:45,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661966784] [2021-11-07 09:25:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:45,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:46,287 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:25:46,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:46,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661966784] [2021-11-07 09:25:46,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661966784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:46,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:46,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 09:25:46,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648432262] [2021-11-07 09:25:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:46,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 09:25:46,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:46,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 09:25:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 09:25:46,289 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:25:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:46,594 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2021-11-07 09:25:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 09:25:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-07 09:25:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:46,595 INFO L225 Difference]: With dead ends: 258 [2021-11-07 09:25:46,595 INFO L226 Difference]: Without dead ends: 220 [2021-11-07 09:25:46,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 288.46ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:25:46,596 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 493 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 127.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.24ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 136.43ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:46,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 200 Invalid, 47 Unknown, 0 Unchecked, 1.24ms Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 136.43ms Time] [2021-11-07 09:25:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-07 09:25:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-11-07 09:25:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.1116279069767443) internal successors, (239), 219 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:25:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 239 transitions. [2021-11-07 09:25:46,606 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 239 transitions. Word has length 51 [2021-11-07 09:25:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:46,607 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 239 transitions. [2021-11-07 09:25:46,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:25:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 239 transitions. [2021-11-07 09:25:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 09:25:46,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:46,608 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:25:46,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 09:25:46,608 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:25:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1409745750, now seen corresponding path program 1 times [2021-11-07 09:25:46,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:46,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187819560] [2021-11-07 09:25:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:46,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:47,293 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:25:47,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:47,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187819560] [2021-11-07 09:25:47,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187819560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:47,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:47,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:25:47,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293383243] [2021-11-07 09:25:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:47,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:25:47,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:25:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:25:47,295 INFO L87 Difference]: Start difference. First operand 220 states and 239 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:25:49,378 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:25:51,536 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:53,671 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:55,830 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:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:25:57,727 INFO L93 Difference]: Finished difference Result 589 states and 639 transitions. [2021-11-07 09:25:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 09:25:57,728 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:25:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:25:57,730 INFO L225 Difference]: With dead ends: 589 [2021-11-07 09:25:57,730 INFO L226 Difference]: Without dead ends: 504 [2021-11-07 09:25:57,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 668.83ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-07 09:25:57,731 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 775 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 21 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9259.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.13ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9903.23ms IncrementalHoareTripleChecker+Time [2021-11-07 09:25:57,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 652 Invalid, 364 Unknown, 0 Unchecked, 6.13ms Time], IncrementalHoareTripleChecker [21 Valid, 339 Invalid, 4 Unknown, 0 Unchecked, 9903.23ms Time] [2021-11-07 09:25:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-11-07 09:25:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 222. [2021-11-07 09:25:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.1105990783410138) internal successors, (241), 221 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:25:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 241 transitions. [2021-11-07 09:25:57,746 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 241 transitions. Word has length 54 [2021-11-07 09:25:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:25:57,746 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 241 transitions. [2021-11-07 09:25:57,746 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:25:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 241 transitions. [2021-11-07 09:25:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-07 09:25:57,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:25:57,747 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:25:57,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 09:25:57,747 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:25:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:25:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937159, now seen corresponding path program 1 times [2021-11-07 09:25:57,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:25:57,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2527174] [2021-11-07 09:25:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:25:57,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:25:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:25:58,585 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:25:58,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:25:58,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2527174] [2021-11-07 09:25:58,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2527174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:25:58,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:25:58,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:25:58,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141877594] [2021-11-07 09:25:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:25:58,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:25:58,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:25:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:25:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:25:58,587 INFO L87 Difference]: Start difference. First operand 222 states and 241 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:26:00,657 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:26:02,818 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:26:04,934 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:26:07,059 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:09,165 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:26:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:11,230 INFO L93 Difference]: Finished difference Result 543 states and 586 transitions. [2021-11-07 09:26:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 09:26:11,230 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:26:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:11,232 INFO L225 Difference]: With dead ends: 543 [2021-11-07 09:26:11,232 INFO L226 Difference]: Without dead ends: 497 [2021-11-07 09:26:11,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 944.61ms TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-07 09:26:11,236 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 749 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 68 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11258.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.25ms SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11934.22ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:11,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 494 Invalid, 446 Unknown, 0 Unchecked, 5.25ms Time], IncrementalHoareTripleChecker [68 Valid, 373 Invalid, 5 Unknown, 0 Unchecked, 11934.22ms Time] [2021-11-07 09:26:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-07 09:26:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 192. [2021-11-07 09:26:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.1122994652406417) internal successors, (208), 191 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:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2021-11-07 09:26:11,250 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 55 [2021-11-07 09:26:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:11,250 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2021-11-07 09:26:11,250 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:26:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2021-11-07 09:26:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-07 09:26:11,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:11,254 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:26:11,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 09:26:11,254 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-07 09:26:11,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:11,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101985676] [2021-11-07 09:26:11,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:11,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:13,779 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:13,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:13,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101985676] [2021-11-07 09:26:13,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101985676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:13,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:13,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:26:13,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523981554] [2021-11-07 09:26:13,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:13,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:26:13,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:13,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:26:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:26:13,781 INFO L87 Difference]: Start difference. First operand 192 states and 208 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:26:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:14,877 INFO L93 Difference]: Finished difference Result 432 states and 464 transitions. [2021-11-07 09:26:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:26:14,878 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:26:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:14,879 INFO L225 Difference]: With dead ends: 432 [2021-11-07 09:26:14,879 INFO L226 Difference]: Without dead ends: 263 [2021-11-07 09:26:14,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 557.94ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:26:14,880 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 492 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 754.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.03ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 802.86ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:14,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 531 Invalid, 257 Unknown, 0 Unchecked, 4.03ms Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 802.86ms Time] [2021-11-07 09:26:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-11-07 09:26:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 196. [2021-11-07 09:26:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.1099476439790577) internal successors, (212), 195 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2021-11-07 09:26:14,890 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 56 [2021-11-07 09:26:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:14,890 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2021-11-07 09:26:14,890 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:26:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2021-11-07 09:26:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-07 09:26:14,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:14,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:26:14,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 09:26:14,892 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash 682041880, now seen corresponding path program 1 times [2021-11-07 09:26:14,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:14,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854984784] [2021-11-07 09:26:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:14,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:15,618 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:15,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:15,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854984784] [2021-11-07 09:26:15,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854984784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:15,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:15,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:26:15,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67456940] [2021-11-07 09:26:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:15,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:26:15,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:26:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:26:15,620 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:26:17,663 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:19,787 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:21,942 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:24,130 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:26:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:26,120 INFO L93 Difference]: Finished difference Result 276 states and 290 transitions. [2021-11-07 09:26:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 09:26:26,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-07 09:26:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:26,121 INFO L225 Difference]: With dead ends: 276 [2021-11-07 09:26:26,121 INFO L226 Difference]: Without dead ends: 250 [2021-11-07 09:26:26,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 824.97ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-07 09:26:26,122 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 353 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 36 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9135.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.20ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9847.94ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:26,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 546 Invalid, 413 Unknown, 0 Unchecked, 4.20ms Time], IncrementalHoareTripleChecker [36 Valid, 373 Invalid, 4 Unknown, 0 Unchecked, 9847.94ms Time] [2021-11-07 09:26:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-07 09:26:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2021-11-07 09:26:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 219 states have (on average 1.095890410958904) internal successors, (240), 223 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:26:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 240 transitions. [2021-11-07 09:26:26,133 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 240 transitions. Word has length 57 [2021-11-07 09:26:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:26,133 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 240 transitions. [2021-11-07 09:26:26,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:26:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 240 transitions. [2021-11-07 09:26:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 09:26:26,134 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:26,134 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:26:26,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 09:26:26,135 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:26:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-07 09:26:26,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:26,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129555941] [2021-11-07 09:26:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:26,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:29,217 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:29,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:29,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129555941] [2021-11-07 09:26:29,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129555941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:29,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:29,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 09:26:29,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027269211] [2021-11-07 09:26:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:29,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 09:26:29,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 09:26:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-07 09:26:29,220 INFO L87 Difference]: Start difference. First operand 224 states and 240 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:26:31,262 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:33,422 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:26:35,533 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:26:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:38,034 INFO L93 Difference]: Finished difference Result 451 states and 478 transitions. [2021-11-07 09:26:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 09:26:38,035 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:26:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:38,036 INFO L225 Difference]: With dead ends: 451 [2021-11-07 09:26:38,036 INFO L226 Difference]: Without dead ends: 297 [2021-11-07 09:26:38,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1300.74ms TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2021-11-07 09:26:38,037 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 540 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7510.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.65ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8045.89ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:38,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 1023 Invalid, 492 Unknown, 0 Unchecked, 7.65ms Time], IncrementalHoareTripleChecker [15 Valid, 474 Invalid, 3 Unknown, 0 Unchecked, 8045.89ms Time] [2021-11-07 09:26:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-07 09:26:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 224. [2021-11-07 09:26:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 219 states have (on average 1.091324200913242) internal successors, (239), 223 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:26:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2021-11-07 09:26:38,050 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 59 [2021-11-07 09:26:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:38,051 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2021-11-07 09:26:38,051 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:26:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2021-11-07 09:26:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 09:26:38,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:38,052 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:26:38,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 09:26:38,052 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-07 09:26:38,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:38,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477016234] [2021-11-07 09:26:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:38,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:42,413 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:42,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:42,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477016234] [2021-11-07 09:26:42,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477016234] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:42,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:42,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 09:26:42,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327127909] [2021-11-07 09:26:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:42,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 09:26:42,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 09:26:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:26:42,415 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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:26:44,464 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:46,587 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:48,698 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:26:50,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:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:26:53,080 INFO L93 Difference]: Finished difference Result 386 states and 414 transitions. [2021-11-07 09:26:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 09:26:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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:26:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:26:53,081 INFO L225 Difference]: With dead ends: 386 [2021-11-07 09:26:53,081 INFO L226 Difference]: Without dead ends: 314 [2021-11-07 09:26:53,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1421.75ms TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-11-07 09:26:53,082 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 393 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9283.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.54ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9776.64ms IncrementalHoareTripleChecker+Time [2021-11-07 09:26:53,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 816 Invalid, 490 Unknown, 0 Unchecked, 5.54ms Time], IncrementalHoareTripleChecker [24 Valid, 462 Invalid, 4 Unknown, 0 Unchecked, 9776.64ms Time] [2021-11-07 09:26:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-11-07 09:26:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 233. [2021-11-07 09:26:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.0964912280701755) internal successors, (250), 232 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:26:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2021-11-07 09:26:53,100 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 62 [2021-11-07 09:26:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:26:53,101 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2021-11-07 09:26:53,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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:26:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2021-11-07 09:26:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 09:26:53,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:26:53,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:26:53,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 09:26:53,102 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:26:53,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:26:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-07 09:26:53,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:26:53,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46897536] [2021-11-07 09:26:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:26:53,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:26:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:26:53,894 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:53,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:26:53,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46897536] [2021-11-07 09:26:53,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46897536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:26:53,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:26:53,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 09:26:53,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286482600] [2021-11-07 09:26:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:26:53,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 09:26:53,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:26:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 09:26:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:26:53,896 INFO L87 Difference]: Start difference. First operand 233 states and 250 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:26:55,959 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:26:58,078 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:27:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:27:01,619 INFO L93 Difference]: Finished difference Result 348 states and 370 transitions. [2021-11-07 09:27:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-07 09:27:01,619 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:27:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:27:01,620 INFO L225 Difference]: With dead ends: 348 [2021-11-07 09:27:01,620 INFO L226 Difference]: Without dead ends: 340 [2021-11-07 09:27:01,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1613.49ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-07 09:27:01,622 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 377 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 237 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6081.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.08ms SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6437.05ms IncrementalHoareTripleChecker+Time [2021-11-07 09:27:01,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 588 Invalid, 921 Unknown, 0 Unchecked, 8.08ms Time], IncrementalHoareTripleChecker [237 Valid, 682 Invalid, 2 Unknown, 0 Unchecked, 6437.05ms Time] [2021-11-07 09:27:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-07 09:27:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 238. [2021-11-07 09:27:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.094420600858369) internal successors, (255), 237 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:27:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 255 transitions. [2021-11-07 09:27:01,637 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 255 transitions. Word has length 64 [2021-11-07 09:27:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:27:01,637 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 255 transitions. [2021-11-07 09:27:01,637 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:27:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 255 transitions. [2021-11-07 09:27:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 09:27:01,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:27:01,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:27:01,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 09:27:01,639 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:27:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:27:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1997517733, now seen corresponding path program 1 times [2021-11-07 09:27:01,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:27:01,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812724690] [2021-11-07 09:27:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:27:01,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:27:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:27:02,453 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:27:02,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:27:02,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812724690] [2021-11-07 09:27:02,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812724690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:27:02,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:27:02,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 09:27:02,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241987221] [2021-11-07 09:27:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:27:02,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 09:27:02,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:27:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 09:27:02,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:27:02,455 INFO L87 Difference]: Start difference. First operand 238 states and 255 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:27:04,514 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:27:06,647 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:27:08,788 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:27:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:27:10,021 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2021-11-07 09:27:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 09:27:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-07 09:27:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:27:10,022 INFO L225 Difference]: With dead ends: 256 [2021-11-07 09:27:10,022 INFO L226 Difference]: Without dead ends: 197 [2021-11-07 09:27:10,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 758.18ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:27:10,023 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 47 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6588.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.32ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7044.11ms IncrementalHoareTripleChecker+Time [2021-11-07 09:27:10,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 481 Invalid, 173 Unknown, 0 Unchecked, 2.32ms Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 3 Unknown, 0 Unchecked, 7044.11ms Time] [2021-11-07 09:27:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-07 09:27:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-11-07 09:27:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.1041666666666667) internal successors, (212), 196 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:27:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2021-11-07 09:27:10,036 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 65 [2021-11-07 09:27:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:27:10,036 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2021-11-07 09:27:10,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:27:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2021-11-07 09:27:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 09:27:10,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:27:10,037 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:27:10,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 09:27:10,038 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:27:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:27:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-07 09:27:10,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:27:10,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326182414] [2021-11-07 09:27:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:27:10,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:27:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:27:14,512 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:27:14,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:27:14,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326182414] [2021-11-07 09:27:14,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326182414] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:27:14,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730560492] [2021-11-07 09:27:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:27:14,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:27:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:27:14,515 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:27:14,515 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:27:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:27:15,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 2958 conjuncts, 77 conjunts are in the unsatisfiable core [2021-11-07 09:27:15,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:27:15,472 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:27:15,750 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-07 09:27:15,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-07 09:27:16,203 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 23 treesize of output 19 [2021-11-07 09:27:16,878 INFO L354 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2021-11-07 09:27:16,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2021-11-07 09:27:17,043 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 36 treesize of output 18 [2021-11-07 09:27:17,156 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-11-07 09:27:17,157 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 44 treesize of output 22 [2021-11-07 09:27:17,813 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-07 09:27:17,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2021-11-07 09:27:17,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:27:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:27:17,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-11-07 09:27:17,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:27:17,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:27:17,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2021-11-07 09:27:18,768 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:27:18,769 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:27:18,974 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:27:18,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 09:27:19,784 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-07 09:27:19,784 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:27:22,041 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:27:24,427 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:27:27,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)))))) is different from false [2021-11-07 09:27:29,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)) (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)))) is different from false [2021-11-07 09:27:31,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)))) is different from false [2021-11-07 09:27:37,108 INFO L354 Elim1Store]: treesize reduction 184, result has 32.8 percent of original size [2021-11-07 09:27:37,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 195584 treesize of output 127321 [2021-11-07 09:27:38,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:27:38,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131399 treesize of output 125811 [2021-11-07 09:27:44,768 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:27:44,846 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:27:44,846 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:27:47,608 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:27:47,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730560492] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 09:27:47,608 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 09:27:47,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 42 [2021-11-07 09:27:47,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632218802] [2021-11-07 09:27:47,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 09:27:47,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-07 09:27:47,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:27:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-07 09:27:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1181, Unknown=5, NotChecked=370, Total=1722 [2021-11-07 09:27:47,611 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:27:49,660 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:27:51,811 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:27:53,992 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:27:56,163 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:27:58,319 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:28:00,443 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:28:04,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) .cse1))) (and (= c_ULTIMATE.start_save_byte_from_array_~array.offset 0) (= |c_ULTIMATE.start_bounded_malloc_#res.offset| 0) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (not (= |c_ULTIMATE.start_bounded_malloc_#res.base| 0)) (= .cse0 c_ULTIMATE.start_save_byte_from_array_~array.base) (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) .cse1) 0) (= c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base| c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (not (= |c_ULTIMATE.start_bounded_malloc_#res.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse2 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse3 (store (select .cse2 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse3 8 (select .cse3 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)))) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|))))) is different from false [2021-11-07 09:28:06,041 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 1) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)))) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)))) is different from false [2021-11-07 09:28:08,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 1) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)) (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)))) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= c_ULTIMATE.start_save_byte_from_array_~storage.base |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|)))) is different from false [2021-11-07 09:28:10,069 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset|)) 0)) (= |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_satisfies_pred_harness_~#cur~3.base|) 1)) is different from false [2021-11-07 09:28:12,076 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 8) 0)) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 1) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0)))) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) is different from false [2021-11-07 09:28:14,093 WARN L838 $PredicateComparison]: unable to prove that (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 (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8) 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0))))) is different from false [2021-11-07 09:28:16,193 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8) 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0)) is different from false [2021-11-07 09:28:18,241 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8) 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0) (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:28:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:28:21,214 INFO L93 Difference]: Finished difference Result 380 states and 409 transitions. [2021-11-07 09:28:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 09:28:21,215 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-07 09:28:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:28:21,216 INFO L225 Difference]: With dead ends: 380 [2021-11-07 09:28:21,216 INFO L226 Difference]: Without dead ends: 305 [2021-11-07 09:28:21,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 32694.63ms TimeCoverageRelationStatistics Valid=424, Invalid=2585, Unknown=13, NotChecked=1534, Total=4556 [2021-11-07 09:28:21,218 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 531 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 36 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14120.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.67ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1661 IncrementalHoareTripleChecker+Unchecked, 15055.83ms IncrementalHoareTripleChecker+Time [2021-11-07 09:28:21,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 2653 Invalid, 2362 Unknown, 0 Unchecked, 17.67ms Time], IncrementalHoareTripleChecker [36 Valid, 659 Invalid, 6 Unknown, 1661 Unchecked, 15055.83ms Time] [2021-11-07 09:28:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-11-07 09:28:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 181. [2021-11-07 09:28:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 177 states have (on average 1.0903954802259888) internal successors, (193), 180 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:28:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 193 transitions. [2021-11-07 09:28:21,230 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 193 transitions. Word has length 65 [2021-11-07 09:28:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:28:21,230 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 193 transitions. [2021-11-07 09:28:21,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:28:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 193 transitions. [2021-11-07 09:28:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 09:28:21,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:28:21,231 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:28:21,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 09:28:21,459 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:28:21,460 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:28:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:28:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1261449879, now seen corresponding path program 1 times [2021-11-07 09:28:21,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:28:21,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370594401] [2021-11-07 09:28:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:28:21,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:28:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:28:22,260 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:28:22,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:28:22,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370594401] [2021-11-07 09:28:22,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370594401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:28:22,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:28:22,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:28:22,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274486828] [2021-11-07 09:28:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:28:22,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:28:22,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:28:22,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:28:22,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:28:22,262 INFO L87 Difference]: Start difference. First operand 181 states and 193 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:28:24,314 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:28:26,453 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:28:28,577 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:28:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:28:30,152 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2021-11-07 09:28:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 09:28:30,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:28:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:28:30,153 INFO L225 Difference]: With dead ends: 260 [2021-11-07 09:28:30,153 INFO L226 Difference]: Without dead ends: 229 [2021-11-07 09:28:30,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 899.95ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-11-07 09:28:30,154 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 346 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6836.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.96ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7260.99ms IncrementalHoareTripleChecker+Time [2021-11-07 09:28:30,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 498 Invalid, 272 Unknown, 0 Unchecked, 3.96ms Time], IncrementalHoareTripleChecker [28 Valid, 241 Invalid, 3 Unknown, 0 Unchecked, 7260.99ms Time] [2021-11-07 09:28:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-07 09:28:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 170. [2021-11-07 09:28:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 166 states have (on average 1.0783132530120483) internal successors, (179), 169 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:28:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 179 transitions. [2021-11-07 09:28:30,166 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 179 transitions. Word has length 69 [2021-11-07 09:28:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:28:30,166 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 179 transitions. [2021-11-07 09:28:30,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:28:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 179 transitions. [2021-11-07 09:28:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 09:28:30,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:28:30,167 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:28:30,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 09:28:30,167 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:28:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:28:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-07 09:28:30,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:28:30,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359513399] [2021-11-07 09:28:30,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:28:30,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:28:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:28:30,978 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:28:30,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:28:30,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359513399] [2021-11-07 09:28:30,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359513399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:28:30,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:28:30,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:28:30,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174988994] [2021-11-07 09:28:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:28:30,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:28:30,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:28:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:28:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:28:30,980 INFO L87 Difference]: Start difference. First operand 170 states and 179 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:28:33,027 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:28:35,230 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:28:37,352 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:28:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:28:38,655 INFO L93 Difference]: Finished difference Result 320 states and 341 transitions. [2021-11-07 09:28:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:28:38,656 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:28:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:28:38,657 INFO L225 Difference]: With dead ends: 320 [2021-11-07 09:28:38,657 INFO L226 Difference]: Without dead ends: 248 [2021-11-07 09:28:38,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 263.07ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-07 09:28:38,658 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 173 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7055.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.87ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7567.08ms IncrementalHoareTripleChecker+Time [2021-11-07 09:28:38,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 585 Invalid, 360 Unknown, 0 Unchecked, 3.87ms Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 3 Unknown, 0 Unchecked, 7567.08ms Time] [2021-11-07 09:28:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-11-07 09:28:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 176. [2021-11-07 09:28:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.0813953488372092) internal successors, (186), 175 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:28:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2021-11-07 09:28:38,671 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 69 [2021-11-07 09:28:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:28:38,672 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2021-11-07 09:28:38,672 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:28:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2021-11-07 09:28:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 09:28:38,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:28:38,673 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:28:38,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 09:28:38,673 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:28:38,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:28:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1058361341, now seen corresponding path program 1 times [2021-11-07 09:28:38,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:28:38,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727762310] [2021-11-07 09:28:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:28:38,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:28:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:28:39,682 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:28:39,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:28:39,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727762310] [2021-11-07 09:28:39,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727762310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:28:39,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:28:39,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 09:28:39,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393197545] [2021-11-07 09:28:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:28:39,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 09:28:39,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:28:39,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 09:28:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 09:28:39,684 INFO L87 Difference]: Start difference. First operand 176 states and 186 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:28:41,745 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:28:43,933 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:28:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:28:44,662 INFO L93 Difference]: Finished difference Result 263 states and 279 transitions. [2021-11-07 09:28:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 09:28:44,663 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:28:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:28:44,663 INFO L225 Difference]: With dead ends: 263 [2021-11-07 09:28:44,664 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 09:28:44,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 165.10ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:28:44,664 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 47 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4492.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4881.44ms IncrementalHoareTripleChecker+Time [2021-11-07 09:28:44,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 379 Invalid, 142 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 4881.44ms Time] [2021-11-07 09:28:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 09:28:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2021-11-07 09:28:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 188 states have (on average 1.0797872340425532) internal successors, (203), 191 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:28:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2021-11-07 09:28:44,677 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 72 [2021-11-07 09:28:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:28:44,677 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2021-11-07 09:28:44,677 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:28:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2021-11-07 09:28:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-07 09:28:44,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:28:44,678 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:28:44,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 09:28:44,679 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:28:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:28:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1034320377, now seen corresponding path program 1 times [2021-11-07 09:28:44,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:28:44,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024475738] [2021-11-07 09:28:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:28:44,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:28:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:28:45,962 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:28:45,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:28:45,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024475738] [2021-11-07 09:28:45,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024475738] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:28:45,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624811283] [2021-11-07 09:28:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:28:45,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:28:45,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:28:45,964 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:28:45,964 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:28:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:28:46,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 3007 conjuncts, 99 conjunts are in the unsatisfiable core [2021-11-07 09:28:46,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:28:47,400 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:28:47,863 INFO L354 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-11-07 09:28:47,864 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:28:48,170 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-07 09:28:48,170 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:28:49,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:28:49,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:28:49,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:28:49,230 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 09:28:49,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, 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:28:49,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:28:49,285 INFO L354 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2021-11-07 09:28:49,285 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:28:49,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:28:49,418 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-07 09:28:49,419 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:28:53,594 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:28:53,595 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:28:53,785 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:28:53,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 09:28:57,850 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:28:57,851 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:28:57,944 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:28:58,304 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:28:58,420 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:28:58,514 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:28:58,515 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:28:58,878 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:28:58,878 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:29:06,240 INFO L354 Elim1Store]: treesize reduction 246, result has 33.2 percent of original size [2021-11-07 09:29:06,240 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 1587 treesize of output 1611 [2021-11-07 09:29:06,350 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 09:29:06,350 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 1572 treesize of output 1492 [2021-11-07 09:29:07,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-07 09:29:09,354 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 47 treesize of output 45 [2021-11-07 09:29:11,676 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:29:11,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624811283] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 09:29:11,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 09:29:11,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 48 [2021-11-07 09:29:11,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549851919] [2021-11-07 09:29:11,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 09:29:11,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-07 09:29:11,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:29:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-07 09:29:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2061, Unknown=3, NotChecked=0, Total=2256 [2021-11-07 09:29:11,678 INFO L87 Difference]: Start difference. First operand 192 states and 203 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:29:13,726 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:29:15,963 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 09:29:18,114 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:29:20,267 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:29:22,373 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:29:24,547 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:29:26,685 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:29:28,828 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:29:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:29:52,342 INFO L93 Difference]: Finished difference Result 387 states and 410 transitions. [2021-11-07 09:29:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-07 09:29:52,343 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:29:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:29:52,344 INFO L225 Difference]: With dead ends: 387 [2021-11-07 09:29:52,344 INFO L226 Difference]: Without dead ends: 308 [2021-11-07 09:29:52,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 127 SyntacticMatches, 8 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 31553.56ms TimeCoverageRelationStatistics Valid=2116, Invalid=9437, Unknown=3, NotChecked=0, Total=11556 [2021-11-07 09:29:52,347 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 1696 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 240 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21554.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.31ms SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 23057.47ms IncrementalHoareTripleChecker+Time [2021-11-07 09:29:52,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1696 Valid, 2125 Invalid, 2365 Unknown, 0 Unchecked, 23.31ms Time], IncrementalHoareTripleChecker [240 Valid, 1775 Invalid, 8 Unknown, 342 Unchecked, 23057.47ms Time] [2021-11-07 09:29:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-11-07 09:29:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 186. [2021-11-07 09:29:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 182 states have (on average 1.065934065934066) internal successors, (194), 185 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:29:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 194 transitions. [2021-11-07 09:29:52,362 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 194 transitions. Word has length 74 [2021-11-07 09:29:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:29:52,362 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 194 transitions. [2021-11-07 09:29:52,362 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:29:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 194 transitions. [2021-11-07 09:29:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 09:29:52,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:29:52,363 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:29:52,399 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:29:52,587 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,SelfDestructingSolverStorable26 [2021-11-07 09:29:52,587 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:29:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:29:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash 144726291, now seen corresponding path program 1 times [2021-11-07 09:29:52,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:29:52,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282697262] [2021-11-07 09:29:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:29:52,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:29:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:29:57,375 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:29:57,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:29:57,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282697262] [2021-11-07 09:29:57,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282697262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:29:57,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:29:57,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 09:29:57,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470167950] [2021-11-07 09:29:57,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:29:57,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 09:29:57,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:29:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 09:29:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-07 09:29:57,377 INFO L87 Difference]: Start difference. First operand 186 states and 194 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 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:29:59,427 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:30:01,594 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:30:03,730 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:30:05,871 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:30:08,006 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:30:10,211 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:30:12,333 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:30:14,474 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:30:16,600 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:30:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:30:20,668 INFO L93 Difference]: Finished difference Result 231 states and 242 transitions. [2021-11-07 09:30:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 09:30:20,669 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 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:30:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:30:20,669 INFO L225 Difference]: With dead ends: 231 [2021-11-07 09:30:20,669 INFO L226 Difference]: Without dead ends: 176 [2021-11-07 09:30:20,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 3365.48ms TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2021-11-07 09:30:20,670 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 461 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 61 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19299.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.49ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20598.36ms IncrementalHoareTripleChecker+Time [2021-11-07 09:30:20,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 460 Invalid, 455 Unknown, 0 Unchecked, 5.49ms Time], IncrementalHoareTripleChecker [61 Valid, 385 Invalid, 9 Unknown, 0 Unchecked, 20598.36ms Time] [2021-11-07 09:30:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-07 09:30:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2021-11-07 09:30:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.0470588235294118) internal successors, (178), 171 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:30:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 178 transitions. [2021-11-07 09:30:20,682 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 178 transitions. Word has length 75 [2021-11-07 09:30:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:30:20,682 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 178 transitions. [2021-11-07 09:30:20,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 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:30:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2021-11-07 09:30:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-07 09:30:20,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:30:20,683 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] [2021-11-07 09:30:20,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 09:30:20,684 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:30:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:30:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -713304796, now seen corresponding path program 1 times [2021-11-07 09:30:20,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:30:20,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611606386] [2021-11-07 09:30:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:30:20,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:30:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:30:21,453 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:30:21,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:30:21,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611606386] [2021-11-07 09:30:21,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611606386] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:30:21,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:30:21,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 09:30:21,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307979180] [2021-11-07 09:30:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:30:21,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 09:30:21,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:30:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 09:30:21,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-07 09:30:21,455 INFO L87 Difference]: Start difference. First operand 172 states and 178 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:30:23,536 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:30:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:30:24,396 INFO L93 Difference]: Finished difference Result 212 states and 219 transitions. [2021-11-07 09:30:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:30:24,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-11-07 09:30:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:30:24,397 INFO L225 Difference]: With dead ends: 212 [2021-11-07 09:30:24,397 INFO L226 Difference]: Without dead ends: 166 [2021-11-07 09:30:24,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 392.40ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-07 09:30:24,398 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 259 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2548.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.51ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2752.01ms IncrementalHoareTripleChecker+Time [2021-11-07 09:30:24,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 418 Invalid, 149 Unknown, 0 Unchecked, 2.51ms Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 1 Unknown, 0 Unchecked, 2752.01ms Time] [2021-11-07 09:30:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-07 09:30:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 136. [2021-11-07 09:30:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.0522388059701493) internal successors, (141), 135 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:30:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2021-11-07 09:30:24,406 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 77 [2021-11-07 09:30:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:30:24,407 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2021-11-07 09:30:24,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:30:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2021-11-07 09:30:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-07 09:30:24,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:30:24,408 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] [2021-11-07 09:30:24,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 09:30:24,408 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:30:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:30:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1823892115, now seen corresponding path program 1 times [2021-11-07 09:30:24,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:30:24,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81119149] [2021-11-07 09:30:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:30:24,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:30:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:30:25,318 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:30:25,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:30:25,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81119149] [2021-11-07 09:30:25,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81119149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:30:25,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:30:25,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:30:25,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588315734] [2021-11-07 09:30:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:30:25,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:30:25,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:30:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:30:25,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:30:25,321 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:27,368 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:30:29,520 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:30:31,684 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:30:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:30:32,883 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2021-11-07 09:30:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 09:30:32,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-07 09:30:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:30:32,885 INFO L225 Difference]: With dead ends: 211 [2021-11-07 09:30:32,885 INFO L226 Difference]: Without dead ends: 166 [2021-11-07 09:30:32,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 533.13ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-07 09:30:32,886 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 210 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6783.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.00ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7256.57ms IncrementalHoareTripleChecker+Time [2021-11-07 09:30:32,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 365 Invalid, 239 Unknown, 0 Unchecked, 3.00ms Time], IncrementalHoareTripleChecker [16 Valid, 220 Invalid, 3 Unknown, 0 Unchecked, 7256.57ms Time] [2021-11-07 09:30:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-07 09:30:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2021-11-07 09:30:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.0522875816993464) internal successors, (161), 154 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:30:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2021-11-07 09:30:32,898 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 83 [2021-11-07 09:30:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:30:32,898 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2021-11-07 09:30:32,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2021-11-07 09:30:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-07 09:30:32,899 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:30:32,900 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] [2021-11-07 09:30:32,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 09:30:32,900 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 09:30:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:30:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash -444221812, now seen corresponding path program 1 times [2021-11-07 09:30:32,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:30:32,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979472846] [2021-11-07 09:30:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:30:32,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:30:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:30:37,262 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:30:37,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:30:37,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979472846] [2021-11-07 09:30:37,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979472846] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:30:37,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159831180] [2021-11-07 09:30:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:30:37,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:30:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:30:37,264 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:30:37,265 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:30:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:30:38,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 3043 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-07 09:30:38,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:30:38,142 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:30:38,410 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 09:30:38,410 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:30:38,806 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:30:39,603 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-07 09:30:39,604 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:30:39,833 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:30:39,957 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-07 09:30:39,958 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:30:41,212 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-07 09:30:41,212 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:30:41,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:30:41,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:30:41,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-11-07 09:30:42,852 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base] [2021-11-07 09:30:42,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 09:30:42,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-11-07 09:30:42,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79222709] [2021-11-07 09:30:42,853 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-07 09:30:42,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 09:30:42,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:30:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 09:30:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2021-11-07 09:30:42,854 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:30:44,909 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:30:47,056 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:30:49,218 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:30:51,349 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:30:53,481 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:30:55,620 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:30:57,805 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:30:59,929 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:31:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:31:06,574 INFO L93 Difference]: Finished difference Result 188 states and 194 transitions. [2021-11-07 09:31:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 09:31:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-11-07 09:31:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:31:06,576 INFO L225 Difference]: With dead ends: 188 [2021-11-07 09:31:06,576 INFO L226 Difference]: Without dead ends: 161 [2021-11-07 09:31:06,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 7659.23ms TimeCoverageRelationStatistics Valid=488, Invalid=2374, Unknown=0, NotChecked=0, Total=2862 [2021-11-07 09:31:06,577 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 597 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 77 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17480.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.69ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18687.50ms IncrementalHoareTripleChecker+Time [2021-11-07 09:31:06,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 545 Invalid, 526 Unknown, 0 Unchecked, 6.69ms Time], IncrementalHoareTripleChecker [77 Valid, 441 Invalid, 8 Unknown, 0 Unchecked, 18687.50ms Time] [2021-11-07 09:31:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-07 09:31:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-07 09:31:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0408163265306123) internal successors, (153), 147 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:31:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2021-11-07 09:31:06,587 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 86 [2021-11-07 09:31:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:31:06,587 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2021-11-07 09:31:06,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:31:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2021-11-07 09:31:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 09:31:06,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:31:06,588 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] [2021-11-07 09:31:06,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 09:31:06,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:31:06,789 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:31:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:31:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash 891065369, now seen corresponding path program 1 times [2021-11-07 09:31:06,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:31:06,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030657956] [2021-11-07 09:31:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:31:06,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:31:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:31:08,191 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:31:08,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:31:08,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030657956] [2021-11-07 09:31:08,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030657956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:31:08,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:31:08,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:31:08,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978434904] [2021-11-07 09:31:08,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:31:08,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:31:08,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:31:08,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:31:08,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:31:08,193 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:31:10,268 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:31:12,402 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:31:14,522 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:31:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:31:15,686 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2021-11-07 09:31:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 09:31:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-07 09:31:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:31:15,687 INFO L225 Difference]: With dead ends: 172 [2021-11-07 09:31:15,687 INFO L226 Difference]: Without dead ends: 148 [2021-11-07 09:31:15,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 670.75ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-11-07 09:31:15,688 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 186 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6671.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.55ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7142.36ms IncrementalHoareTripleChecker+Time [2021-11-07 09:31:15,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 297 Invalid, 197 Unknown, 0 Unchecked, 2.55ms Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 3 Unknown, 0 Unchecked, 7142.36ms Time] [2021-11-07 09:31:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-07 09:31:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-11-07 09:31:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:31:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2021-11-07 09:31:15,700 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 94 [2021-11-07 09:31:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:31:15,700 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2021-11-07 09:31:15,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:31:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2021-11-07 09:31:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-07 09:31:15,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:31:15,702 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, 1] [2021-11-07 09:31:15,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 09:31:15,702 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:31:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:31:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -864157206, now seen corresponding path program 1 times [2021-11-07 09:31:15,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:31:15,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651984723] [2021-11-07 09:31:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:31:15,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:31:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:31:17,036 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:31:17,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:31:17,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651984723] [2021-11-07 09:31:17,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651984723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 09:31:17,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 09:31:17,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 09:31:17,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891577393] [2021-11-07 09:31:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 09:31:17,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 09:31:17,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:31:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 09:31:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 09:31:17,038 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 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:31:19,087 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:31:21,289 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:31:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 09:31:22,520 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2021-11-07 09:31:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 09:31:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 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 100 [2021-11-07 09:31:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 09:31:22,521 INFO L225 Difference]: With dead ends: 158 [2021-11-07 09:31:22,521 INFO L226 Difference]: Without dead ends: 148 [2021-11-07 09:31:22,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 624.95ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-07 09:31:22,522 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 242 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4662.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5084.99ms IncrementalHoareTripleChecker+Time [2021-11-07 09:31:22,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 200 Invalid, 189 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [21 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 5084.99ms Time] [2021-11-07 09:31:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-07 09:31:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-11-07 09:31:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0272108843537415) internal successors, (151), 147 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 09:31:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2021-11-07 09:31:22,533 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 100 [2021-11-07 09:31:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 09:31:22,533 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2021-11-07 09:31:22,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 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:31:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2021-11-07 09:31:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-07 09:31:22,534 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 09:31:22,534 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 09:31:22,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 09:31:22,535 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:31:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 09:31:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -435248645, now seen corresponding path program 1 times [2021-11-07 09:31:22,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 09:31:22,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298748294] [2021-11-07 09:31:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:31:22,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 09:31:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:31:42,364 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:31:42,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 09:31:42,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298748294] [2021-11-07 09:31:42,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298748294] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 09:31:42,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603576004] [2021-11-07 09:31:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 09:31:42,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 09:31:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 09:31:42,366 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:31:42,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 09:37:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 09:37:56,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 3138 conjuncts, 188 conjunts are in the unsatisfiable core [2021-11-07 09:37:56,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 09:37:56,348 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:37:57,586 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 09:37:57,586 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:37:58,253 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 26 treesize of output 22 [2021-11-07 09:37:58,284 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:37:58,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:37:58,312 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 29 treesize of output 13 [2021-11-07 09:37:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:37:59,773 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 09:37:59,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 35 [2021-11-07 09:38:00,472 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 60 treesize of output 51 [2021-11-07 09:38:00,530 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 34 treesize of output 16 [2021-11-07 09:38:00,580 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 57 treesize of output 27 [2021-11-07 09:38:01,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:38:01,826 INFO L354 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2021-11-07 09:38:01,826 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:38:01,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 09:38:01,916 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-07 09:38:01,917 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 157 treesize of output 117 [2021-11-07 09:38:01,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:02,113 INFO L354 Elim1Store]: treesize reduction 272, result has 16.3 percent of original size [2021-11-07 09:38:02,114 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 138 treesize of output 174 [2021-11-07 09:38:02,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:02,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:02,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:02,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:02,215 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 0 case distinctions, treesize of input 112 treesize of output 58 [2021-11-07 09:38:02,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:03,083 INFO L354 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2021-11-07 09:38:03,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 57 [2021-11-07 09:38:06,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:06,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:06,635 INFO L354 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2021-11-07 09:38:06,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 50 treesize of output 56 [2021-11-07 09:38:07,784 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:38:07,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:07,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:07,803 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:38:07,831 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 143 treesize of output 113 [2021-11-07 09:38:07,844 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 128 treesize of output 103 [2021-11-07 09:38:07,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:07,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 09:38:07,948 INFO L354 Elim1Store]: treesize reduction 193, result has 6.3 percent of original size [2021-11-07 09:38:07,948 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 109 treesize of output 97 [2021-11-07 09:38:15,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base] [2021-11-07 09:38:15,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 09:38:15,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2021-11-07 09:38:15,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214405736] [2021-11-07 09:38:15,545 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-07 09:38:15,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-07 09:38:15,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 09:38:15,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-07 09:38:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2466, Unknown=0, NotChecked=0, Total=2652 [2021-11-07 09:38:15,547 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand has 30 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15