./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 14:14:05,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 14:14:05,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 14:14:05,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 14:14:05,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 14:14:05,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 14:14:05,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 14:14:05,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 14:14:05,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 14:14:05,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 14:14:05,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 14:14:05,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 14:14:05,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 14:14:05,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 14:14:05,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 14:14:05,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 14:14:05,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 14:14:05,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 14:14:05,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 14:14:05,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 14:14:05,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 14:14:05,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 14:14:05,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 14:14:05,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 14:14:05,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 14:14:05,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 14:14:05,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 14:14:05,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 14:14:05,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 14:14:05,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 14:14:05,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 14:14:05,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 14:14:05,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 14:14:05,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 14:14:05,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 14:14:05,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 14:14:05,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 14:14:05,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 14:14:05,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 14:14:05,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 14:14:05,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 14:14:05,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 14:14:05,548 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 14:14:05,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 14:14:05,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 14:14:05,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 14:14:05,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 14:14:05,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 14:14:05,550 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 14:14:05,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 14:14:05,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 14:14:05,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 14:14:05,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 14:14:05,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 14:14:05,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 14:14:05,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 14:14:05,552 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 14:14:05,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 14:14:05,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 14:14:05,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 14:14:05,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 14:14:05,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 14:14:05,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 14:14:05,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 14:14:05,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 14:14:05,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 14:14:05,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 14:14:05,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 14:14:05,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 14:14:05,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 14:14:05,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 14:14:05,555 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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2021-11-04 14:14:05,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 14:14:05,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 14:14:05,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 14:14:05,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 14:14:05,779 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 14:14:05,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-11-04 14:14:05,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfd26109/5c1b4f1e4aad4a409a08f74d6edebe52/FLAGee58ec188 [2021-11-04 14:14:06,412 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 14:14:06,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-11-04 14:14:06,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfd26109/5c1b4f1e4aad4a409a08f74d6edebe52/FLAGee58ec188 [2021-11-04 14:14:06,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfd26109/5c1b4f1e4aad4a409a08f74d6edebe52 [2021-11-04 14:14:06,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 14:14:06,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 14:14:06,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 14:14:06,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 14:14:06,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 14:14:06,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 02:14:06" (1/1) ... [2021-11-04 14:14:06,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a5584b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:06, skipping insertion in model container [2021-11-04 14:14:06,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 02:14:06" (1/1) ... [2021-11-04 14:14:06,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 14:14:06,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 14:14:08,798 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-11-04 14:14:08,803 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-11-04 14:14:08,804 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-11-04 14:14:08,804 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-11-04 14:14:08,804 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-11-04 14:14:08,805 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-11-04 14:14:08,806 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-11-04 14:14:08,810 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-11-04 14:14:08,810 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-11-04 14:14:08,811 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-11-04 14:14:08,811 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-11-04 14:14:08,816 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-11-04 14:14:08,817 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-11-04 14:14:08,818 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-11-04 14:14:08,819 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-11-04 14:14:08,819 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-11-04 14:14:08,819 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-11-04 14:14:08,824 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-11-04 14:14:08,825 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-11-04 14:14:08,826 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-11-04 14:14:08,827 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-11-04 14:14:08,827 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-11-04 14:14:08,828 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-11-04 14:14:08,828 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-11-04 14:14:08,828 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-11-04 14:14:08,830 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-11-04 14:14:08,830 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-11-04 14:14:08,830 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-11-04 14:14:08,831 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-11-04 14:14:08,832 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-11-04 14:14:08,832 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-11-04 14:14:08,832 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-11-04 14:14:08,833 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-11-04 14:14:08,833 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-11-04 14:14:08,834 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-11-04 14:14:08,834 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-11-04 14:14:08,835 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-11-04 14:14:08,835 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-11-04 14:14:08,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-11-04 14:14:08,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-11-04 14:14:08,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-11-04 14:14:08,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-11-04 14:14:08,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-11-04 14:14:08,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-11-04 14:14:08,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-11-04 14:14:08,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-11-04 14:14:08,838 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-11-04 14:14:08,839 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-11-04 14:14:08,839 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-11-04 14:14:08,839 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-11-04 14:14:08,840 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-11-04 14:14:08,840 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-11-04 14:14:08,840 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-11-04 14:14:08,841 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-11-04 14:14:08,841 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-11-04 14:14:08,841 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-11-04 14:14:08,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-11-04 14:14:08,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-11-04 14:14:08,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-11-04 14:14:08,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-11-04 14:14:08,843 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-11-04 14:14:08,843 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-11-04 14:14:08,844 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-11-04 14:14:08,844 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-11-04 14:14:08,845 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-11-04 14:14:08,845 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-11-04 14:14:08,845 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-11-04 14:14:08,846 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-11-04 14:14:08,846 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-11-04 14:14:08,846 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-11-04 14:14:08,846 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-11-04 14:14:08,847 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-11-04 14:14:08,847 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-11-04 14:14:08,847 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-11-04 14:14:08,848 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-11-04 14:14:08,848 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-11-04 14:14:08,848 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-11-04 14:14:08,848 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-11-04 14:14:08,849 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-11-04 14:14:08,849 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-11-04 14:14:08,850 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-11-04 14:14:08,850 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-11-04 14:14:08,850 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-11-04 14:14:08,850 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-11-04 14:14:08,851 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-11-04 14:14:08,851 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-11-04 14:14:08,851 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-11-04 14:14:08,851 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-11-04 14:14:08,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 14:14:08,882 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 14:14:09,068 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-11-04 14:14:09,069 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-11-04 14:14:09,069 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-11-04 14:14:09,069 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-11-04 14:14:09,069 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-11-04 14:14:09,070 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-11-04 14:14:09,070 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-11-04 14:14:09,070 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-11-04 14:14:09,071 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-11-04 14:14:09,071 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-11-04 14:14:09,071 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-11-04 14:14:09,072 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-11-04 14:14:09,072 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-11-04 14:14:09,072 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-11-04 14:14:09,072 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-11-04 14:14:09,073 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-11-04 14:14:09,073 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-11-04 14:14:09,074 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-11-04 14:14:09,074 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-11-04 14:14:09,074 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-11-04 14:14:09,075 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-11-04 14:14:09,076 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-11-04 14:14:09,076 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-11-04 14:14:09,077 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-11-04 14:14:09,077 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-11-04 14:14:09,077 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-11-04 14:14:09,077 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-11-04 14:14:09,078 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-11-04 14:14:09,078 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-11-04 14:14:09,078 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-11-04 14:14:09,078 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-11-04 14:14:09,079 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-11-04 14:14:09,079 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-11-04 14:14:09,079 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-11-04 14:14:09,079 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-11-04 14:14:09,080 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-11-04 14:14:09,080 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-11-04 14:14:09,081 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-11-04 14:14:09,081 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-11-04 14:14:09,081 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-11-04 14:14:09,082 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-11-04 14:14:09,083 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-11-04 14:14:09,083 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-11-04 14:14:09,083 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-11-04 14:14:09,083 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-11-04 14:14:09,084 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-11-04 14:14:09,084 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-11-04 14:14:09,084 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-11-04 14:14:09,085 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-11-04 14:14:09,085 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-11-04 14:14:09,085 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-11-04 14:14:09,086 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-11-04 14:14:09,086 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-11-04 14:14:09,086 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-11-04 14:14:09,087 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-11-04 14:14:09,087 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-11-04 14:14:09,087 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-11-04 14:14:09,087 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-11-04 14:14:09,088 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-11-04 14:14:09,088 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-11-04 14:14:09,088 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-11-04 14:14:09,089 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-11-04 14:14:09,089 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-11-04 14:14:09,090 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-11-04 14:14:09,091 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-11-04 14:14:09,093 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-11-04 14:14:09,093 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-11-04 14:14:09,093 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-11-04 14:14:09,094 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-11-04 14:14:09,103 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-11-04 14:14:09,103 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-11-04 14:14:09,104 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-11-04 14:14:09,104 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-11-04 14:14:09,104 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-11-04 14:14:09,107 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-11-04 14:14:09,108 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-11-04 14:14:09,111 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-11-04 14:14:09,111 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-11-04 14:14:09,112 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-11-04 14:14:09,113 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-11-04 14:14:09,113 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-11-04 14:14:09,113 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-11-04 14:14:09,114 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-11-04 14:14:09,114 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-11-04 14:14:09,115 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-11-04 14:14:09,115 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-11-04 14:14:09,115 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-11-04 14:14:09,115 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-11-04 14:14:09,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 14:14:09,212 INFO L208 MainTranslator]: Completed translation [2021-11-04 14:14:09,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09 WrapperNode [2021-11-04 14:14:09,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 14:14:09,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 14:14:09,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 14:14:09,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 14:14:09,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 14:14:09,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 14:14:09,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 14:14:09,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 14:14:09,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 14:14:09,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 14:14:09,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 14:14:09,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 14:14:09,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (1/1) ... [2021-11-04 14:14:09,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 14:14:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 14:14:09,644 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-04 14:14:09,663 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-04 14:14:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 14:14:09,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 14:14:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 14:14:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 14:14:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 14:14:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 14:14:13,097 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_5_returnLabel: main_#res := 0; [2021-11-04 14:14:13,098 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-04 14:14:13,098 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L5782: #t~ret640 := main_#res; [2021-11-04 14:14:13,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 14:14:13,112 INFO L299 CfgBuilder]: Removed 1173 assume(true) statements. [2021-11-04 14:14:13,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 02:14:13 BoogieIcfgContainer [2021-11-04 14:14:13,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 14:14:13,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 14:14:13,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 14:14:13,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 14:14:13,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 02:14:06" (1/3) ... [2021-11-04 14:14:13,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa000e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 02:14:13, skipping insertion in model container [2021-11-04 14:14:13,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 02:14:09" (2/3) ... [2021-11-04 14:14:13,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa000e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 02:14:13, skipping insertion in model container [2021-11-04 14:14:13,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 02:14:13" (3/3) ... [2021-11-04 14:14:13,121 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-11-04 14:14:13,124 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 14:14:13,124 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 95 error locations. [2021-11-04 14:14:13,164 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 14:14:13,172 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-04 14:14:13,173 INFO L340 AbstractCegarLoop]: Starting to check reachability of 95 error locations. [2021-11-04 14:14:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 1102 states, 1007 states have (on average 1.4280039721946376) internal successors, (1438), 1101 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-04 14:14:13,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:13,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:14:13,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 763167304, now seen corresponding path program 1 times [2021-11-04 14:14:13,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:13,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395741774] [2021-11-04 14:14:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:13,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:13,692 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-04 14:14:13,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:13,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395741774] [2021-11-04 14:14:13,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395741774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:13,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:13,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:13,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042934631] [2021-11-04 14:14:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:13,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:13,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:13,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:13,722 INFO L87 Difference]: Start difference. First operand has 1102 states, 1007 states have (on average 1.4280039721946376) internal successors, (1438), 1101 states have internal predecessors, (1438), 0 states have call successors, (0), 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 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:15,761 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:18,202 INFO L93 Difference]: Finished difference Result 2130 states and 2783 transitions. [2021-11-04 14:14:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:18,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-04 14:14:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:18,216 INFO L225 Difference]: With dead ends: 2130 [2021-11-04 14:14:18,216 INFO L226 Difference]: Without dead ends: 1028 [2021-11-04 14:14:18,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:18,231 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 1477 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3941.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.73ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4360.68ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:18,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 138 Invalid, 2375 Unknown, 0 Unchecked, 10.73ms Time], IncrementalHoareTripleChecker [2 Valid, 2372 Invalid, 1 Unknown, 0 Unchecked, 4360.68ms Time] [2021-11-04 14:14:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-04 14:14:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2021-11-04 14:14:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 935 states have (on average 1.2823529411764707) internal successors, (1199), 1027 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1199 transitions. [2021-11-04 14:14:18,287 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1199 transitions. Word has length 29 [2021-11-04 14:14:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:18,287 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1199 transitions. [2021-11-04 14:14:18,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1199 transitions. [2021-11-04 14:14:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-04 14:14:18,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:18,288 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] [2021-11-04 14:14:18,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 14:14:18,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1035464564, now seen corresponding path program 1 times [2021-11-04 14:14:18,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:18,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020472577] [2021-11-04 14:14:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:18,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:18,437 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-04 14:14:18,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:18,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020472577] [2021-11-04 14:14:18,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020472577] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:18,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:18,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:18,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834758568] [2021-11-04 14:14:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:18,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:18,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:18,440 INFO L87 Difference]: Start difference. First operand 1028 states and 1199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:20,464 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:22,487 INFO L93 Difference]: Finished difference Result 1028 states and 1199 transitions. [2021-11-04 14:14:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-04 14:14:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:22,491 INFO L225 Difference]: With dead ends: 1028 [2021-11-04 14:14:22,491 INFO L226 Difference]: Without dead ends: 1024 [2021-11-04 14:14:22,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.41ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:22,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1319 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3594.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.33ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3946.79ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:22,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1319 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 6.33ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3946.79ms Time] [2021-11-04 14:14:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-11-04 14:14:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2021-11-04 14:14:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 933 states have (on average 1.2808145766345123) internal successors, (1195), 1023 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1195 transitions. [2021-11-04 14:14:22,516 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1195 transitions. Word has length 31 [2021-11-04 14:14:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:22,516 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1195 transitions. [2021-11-04 14:14:22,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1195 transitions. [2021-11-04 14:14:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-04 14:14:22,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:22,518 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] [2021-11-04 14:14:22,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 14:14:22,518 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1351130928, now seen corresponding path program 1 times [2021-11-04 14:14:22,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:22,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930193587] [2021-11-04 14:14:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:22,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:22,617 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-04 14:14:22,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:22,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930193587] [2021-11-04 14:14:22,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930193587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:22,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:22,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:22,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784900204] [2021-11-04 14:14:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:22,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:22,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:22,619 INFO L87 Difference]: Start difference. First operand 1024 states and 1195 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:24,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:26,541 INFO L93 Difference]: Finished difference Result 1024 states and 1195 transitions. [2021-11-04 14:14:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-04 14:14:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:26,544 INFO L225 Difference]: With dead ends: 1024 [2021-11-04 14:14:26,545 INFO L226 Difference]: Without dead ends: 1020 [2021-11-04 14:14:26,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.26ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:26,546 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1305 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3507.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.58ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3850.98ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:26,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1305 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 4.58ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3850.98ms Time] [2021-11-04 14:14:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2021-11-04 14:14:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2021-11-04 14:14:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 931 states have (on average 1.2792696025778731) internal successors, (1191), 1019 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1191 transitions. [2021-11-04 14:14:26,565 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1191 transitions. Word has length 33 [2021-11-04 14:14:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:26,565 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 1191 transitions. [2021-11-04 14:14:26,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1191 transitions. [2021-11-04 14:14:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 14:14:26,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:26,566 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] [2021-11-04 14:14:26,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 14:14:26,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1356863028, now seen corresponding path program 1 times [2021-11-04 14:14:26,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:26,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201191551] [2021-11-04 14:14:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:26,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:26,722 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-04 14:14:26,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:26,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201191551] [2021-11-04 14:14:26,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201191551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:26,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:26,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:26,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780260266] [2021-11-04 14:14:26,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:26,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:26,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:26,725 INFO L87 Difference]: Start difference. First operand 1020 states and 1191 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:28,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:30,786 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-04 14:14:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:32,686 INFO L93 Difference]: Finished difference Result 1020 states and 1191 transitions. [2021-11-04 14:14:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:32,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-11-04 14:14:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:32,689 INFO L225 Difference]: With dead ends: 1020 [2021-11-04 14:14:32,690 INFO L226 Difference]: Without dead ends: 1016 [2021-11-04 14:14:32,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.13ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:32,691 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1291 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5472.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.18ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5904.50ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:32,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1291 Valid, 0 Invalid, 2238 Unknown, 0 Unchecked, 4.18ms Time], IncrementalHoareTripleChecker [2 Valid, 2235 Invalid, 1 Unknown, 0 Unchecked, 5904.50ms Time] [2021-11-04 14:14:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-11-04 14:14:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2021-11-04 14:14:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 929 states have (on average 1.2777179763186222) internal successors, (1187), 1015 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1187 transitions. [2021-11-04 14:14:32,710 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1187 transitions. Word has length 35 [2021-11-04 14:14:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:32,710 INFO L470 AbstractCegarLoop]: Abstraction has 1016 states and 1187 transitions. [2021-11-04 14:14:32,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1187 transitions. [2021-11-04 14:14:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-04 14:14:32,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:32,711 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] [2021-11-04 14:14:32,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 14:14:32,712 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1724523112, now seen corresponding path program 1 times [2021-11-04 14:14:32,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:32,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759886799] [2021-11-04 14:14:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:32,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:32,792 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-04 14:14:32,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:32,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759886799] [2021-11-04 14:14:32,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759886799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:32,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:32,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:32,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869705246] [2021-11-04 14:14:32,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:32,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:32,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:32,795 INFO L87 Difference]: Start difference. First operand 1016 states and 1187 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:34,813 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:36,797 INFO L93 Difference]: Finished difference Result 1016 states and 1187 transitions. [2021-11-04 14:14:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:36,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-04 14:14:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:36,801 INFO L225 Difference]: With dead ends: 1016 [2021-11-04 14:14:36,801 INFO L226 Difference]: Without dead ends: 1012 [2021-11-04 14:14:36,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:36,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1277 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3627.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.97ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3949.56ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:36,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 3.97ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3949.56ms Time] [2021-11-04 14:14:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-11-04 14:14:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2021-11-04 14:14:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 927 states have (on average 1.2761596548004315) internal successors, (1183), 1011 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1183 transitions. [2021-11-04 14:14:36,823 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1183 transitions. Word has length 37 [2021-11-04 14:14:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:36,823 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1183 transitions. [2021-11-04 14:14:36,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1183 transitions. [2021-11-04 14:14:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-04 14:14:36,824 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:36,825 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] [2021-11-04 14:14:36,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 14:14:36,825 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 590830940, now seen corresponding path program 1 times [2021-11-04 14:14:36,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:36,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647610933] [2021-11-04 14:14:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:36,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:36,903 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-04 14:14:36,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:36,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647610933] [2021-11-04 14:14:36,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647610933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:36,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:36,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:36,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689774448] [2021-11-04 14:14:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:36,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:36,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:36,906 INFO L87 Difference]: Start difference. First operand 1012 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:38,931 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:40,735 INFO L93 Difference]: Finished difference Result 1012 states and 1183 transitions. [2021-11-04 14:14:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:40,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-04 14:14:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:40,740 INFO L225 Difference]: With dead ends: 1012 [2021-11-04 14:14:40,740 INFO L226 Difference]: Without dead ends: 1008 [2021-11-04 14:14:40,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:40,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1263 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3441.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.63ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3776.30ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:40,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 3.63ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3776.30ms Time] [2021-11-04 14:14:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-11-04 14:14:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2021-11-04 14:14:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 925 states have (on average 1.2745945945945947) internal successors, (1179), 1007 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1179 transitions. [2021-11-04 14:14:40,763 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1179 transitions. Word has length 39 [2021-11-04 14:14:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:40,764 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 1179 transitions. [2021-11-04 14:14:40,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1179 transitions. [2021-11-04 14:14:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-04 14:14:40,768 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:40,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:14:40,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 14:14:40,769 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 853015936, now seen corresponding path program 1 times [2021-11-04 14:14:40,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:40,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344358134] [2021-11-04 14:14:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:40,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:40,866 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-04 14:14:40,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:40,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344358134] [2021-11-04 14:14:40,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344358134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:40,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:40,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:40,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333174236] [2021-11-04 14:14:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:40,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:40,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:40,868 INFO L87 Difference]: Start difference. First operand 1008 states and 1179 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:42,886 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:44,671 INFO L93 Difference]: Finished difference Result 1008 states and 1179 transitions. [2021-11-04 14:14:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:44,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-04 14:14:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:44,674 INFO L225 Difference]: With dead ends: 1008 [2021-11-04 14:14:44,674 INFO L226 Difference]: Without dead ends: 1004 [2021-11-04 14:14:44,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.23ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:44,675 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1249 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3388.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.14ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3747.96ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:44,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1249 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 3.14ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3747.96ms Time] [2021-11-04 14:14:44,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-11-04 14:14:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2021-11-04 14:14:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 923 states have (on average 1.2730227518959913) internal successors, (1175), 1003 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1175 transitions. [2021-11-04 14:14:44,701 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1175 transitions. Word has length 41 [2021-11-04 14:14:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:44,701 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 1175 transitions. [2021-11-04 14:14:44,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1175 transitions. [2021-11-04 14:14:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-04 14:14:44,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:44,702 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-04 14:14:44,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 14:14:44,702 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -590273020, now seen corresponding path program 1 times [2021-11-04 14:14:44,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:44,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352325846] [2021-11-04 14:14:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:44,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:44,792 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-04 14:14:44,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:44,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352325846] [2021-11-04 14:14:44,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352325846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:44,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:44,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:44,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083589475] [2021-11-04 14:14:44,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:44,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:44,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:44,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:44,795 INFO L87 Difference]: Start difference. First operand 1004 states and 1175 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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-04 14:14:46,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:48,489 INFO L93 Difference]: Finished difference Result 1004 states and 1175 transitions. [2021-11-04 14:14:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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-04 14:14:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:48,492 INFO L225 Difference]: With dead ends: 1004 [2021-11-04 14:14:48,492 INFO L226 Difference]: Without dead ends: 1000 [2021-11-04 14:14:48,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.88ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:48,493 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1235 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3323.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3645.38ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:48,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3645.38ms Time] [2021-11-04 14:14:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2021-11-04 14:14:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2021-11-04 14:14:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 921 states have (on average 1.271444082519001) internal successors, (1171), 999 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1171 transitions. [2021-11-04 14:14:48,528 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1171 transitions. Word has length 43 [2021-11-04 14:14:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:48,529 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1171 transitions. [2021-11-04 14:14:48,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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-04 14:14:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1171 transitions. [2021-11-04 14:14:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-04 14:14:48,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:48,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:14:48,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 14:14:48,530 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -316523769, now seen corresponding path program 1 times [2021-11-04 14:14:48,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:48,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970755828] [2021-11-04 14:14:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:48,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:48,613 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-04 14:14:48,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:48,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970755828] [2021-11-04 14:14:48,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970755828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:48,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:48,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:48,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580554767] [2021-11-04 14:14:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:48,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:48,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:48,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:48,615 INFO L87 Difference]: Start difference. First operand 1000 states and 1171 transitions. Second operand has 4 states, 4 states have (on average 11.25) 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-04 14:14:50,634 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:52,557 INFO L93 Difference]: Finished difference Result 1000 states and 1171 transitions. [2021-11-04 14:14:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:52,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) 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-04 14:14:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:52,560 INFO L225 Difference]: With dead ends: 1000 [2021-11-04 14:14:52,560 INFO L226 Difference]: Without dead ends: 996 [2021-11-04 14:14:52,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.44ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:52,561 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1221 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3518.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.27ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3882.92ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:52,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1221 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 3.27ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3882.92ms Time] [2021-11-04 14:14:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-11-04 14:14:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2021-11-04 14:14:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 919 states have (on average 1.2698585418933623) internal successors, (1167), 995 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1167 transitions. [2021-11-04 14:14:52,582 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1167 transitions. Word has length 45 [2021-11-04 14:14:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:52,582 INFO L470 AbstractCegarLoop]: Abstraction has 996 states and 1167 transitions. [2021-11-04 14:14:52,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) 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-04 14:14:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1167 transitions. [2021-11-04 14:14:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-04 14:14:52,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:52,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:14:52,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 14:14:52,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 763502699, now seen corresponding path program 1 times [2021-11-04 14:14:52,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:52,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268785282] [2021-11-04 14:14:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:52,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:14:52,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:52,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268785282] [2021-11-04 14:14:52,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268785282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:52,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:52,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:52,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405302028] [2021-11-04 14:14:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:52,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:52,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:52,655 INFO L87 Difference]: Start difference. First operand 996 states and 1167 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 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-04 14:14:54,226 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:56,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:14:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:14:58,283 INFO L93 Difference]: Finished difference Result 996 states and 1167 transitions. [2021-11-04 14:14:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:14:58,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 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-04 14:14:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:14:58,285 INFO L225 Difference]: With dead ends: 996 [2021-11-04 14:14:58,285 INFO L226 Difference]: Without dead ends: 992 [2021-11-04 14:14:58,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:14:58,286 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1207 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5162.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.15ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5557.71ms IncrementalHoareTripleChecker+Time [2021-11-04 14:14:58,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1207 Valid, 0 Invalid, 2238 Unknown, 0 Unchecked, 4.15ms Time], IncrementalHoareTripleChecker [2 Valid, 2235 Invalid, 1 Unknown, 0 Unchecked, 5557.71ms Time] [2021-11-04 14:14:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-11-04 14:14:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2021-11-04 14:14:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 917 states have (on average 1.2682660850599783) internal successors, (1163), 991 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:14:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1163 transitions. [2021-11-04 14:14:58,309 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1163 transitions. Word has length 47 [2021-11-04 14:14:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:14:58,309 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1163 transitions. [2021-11-04 14:14:58,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 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-04 14:14:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1163 transitions. [2021-11-04 14:14:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-04 14:14:58,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:14:58,311 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-04 14:14:58,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 14:14:58,311 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:14:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:14:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -713146833, now seen corresponding path program 1 times [2021-11-04 14:14:58,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:14:58,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205741959] [2021-11-04 14:14:58,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:14:58,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:14:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:14:58,386 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-04 14:14:58,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:14:58,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205741959] [2021-11-04 14:14:58,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205741959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:14:58,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:14:58,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:14:58,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039487375] [2021-11-04 14:14:58,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:14:58,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:14:58,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:14:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:14:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:14:58,389 INFO L87 Difference]: Start difference. First operand 992 states and 1163 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 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-04 14:15:00,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:02,320 INFO L93 Difference]: Finished difference Result 992 states and 1163 transitions. [2021-11-04 14:15:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:02,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 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-04 14:15:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:02,323 INFO L225 Difference]: With dead ends: 992 [2021-11-04 14:15:02,324 INFO L226 Difference]: Without dead ends: 988 [2021-11-04 14:15:02,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.74ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:02,325 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1193 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3514.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3864.06ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:02,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 3864.06ms Time] [2021-11-04 14:15:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2021-11-04 14:15:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2021-11-04 14:15:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 915 states have (on average 1.2666666666666666) internal successors, (1159), 987 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1159 transitions. [2021-11-04 14:15:02,373 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1159 transitions. Word has length 49 [2021-11-04 14:15:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:02,373 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 1159 transitions. [2021-11-04 14:15:02,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 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-04 14:15:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1159 transitions. [2021-11-04 14:15:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-04 14:15:02,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:02,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:15:02,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 14:15:02,374 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1860828243, now seen corresponding path program 1 times [2021-11-04 14:15:02,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:02,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290405494] [2021-11-04 14:15:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:02,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:02,473 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-04 14:15:02,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:02,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290405494] [2021-11-04 14:15:02,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290405494] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:02,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:02,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:02,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465999300] [2021-11-04 14:15:02,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:02,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:02,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:02,475 INFO L87 Difference]: Start difference. First operand 988 states and 1159 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 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-04 14:15:04,496 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:06,651 INFO L93 Difference]: Finished difference Result 988 states and 1159 transitions. [2021-11-04 14:15:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 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-04 14:15:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:06,654 INFO L225 Difference]: With dead ends: 988 [2021-11-04 14:15:06,654 INFO L226 Difference]: Without dead ends: 984 [2021-11-04 14:15:06,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.73ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:06,655 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1179 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3757.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.80ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4092.58ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:06,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 4.80ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 4092.58ms Time] [2021-11-04 14:15:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2021-11-04 14:15:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2021-11-04 14:15:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 913 states have (on average 1.2650602409638554) internal successors, (1155), 983 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1155 transitions. [2021-11-04 14:15:06,683 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1155 transitions. Word has length 51 [2021-11-04 14:15:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:06,683 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1155 transitions. [2021-11-04 14:15:06,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 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-04 14:15:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1155 transitions. [2021-11-04 14:15:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-04 14:15:06,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:06,684 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] [2021-11-04 14:15:06,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 14:15:06,685 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1549714135, now seen corresponding path program 1 times [2021-11-04 14:15:06,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:06,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147387280] [2021-11-04 14:15:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:06,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:06,782 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-04 14:15:06,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:06,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147387280] [2021-11-04 14:15:06,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147387280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:06,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:06,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:06,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677187083] [2021-11-04 14:15:06,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:06,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:06,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:06,784 INFO L87 Difference]: Start difference. First operand 984 states and 1155 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:08,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:10,913 INFO L93 Difference]: Finished difference Result 984 states and 1155 transitions. [2021-11-04 14:15:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:10,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-04 14:15:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:10,916 INFO L225 Difference]: With dead ends: 984 [2021-11-04 14:15:10,916 INFO L226 Difference]: Without dead ends: 980 [2021-11-04 14:15:10,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:10,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1165 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3716.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.87ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4040.36ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:10,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 0 Invalid, 2237 Unknown, 0 Unchecked, 4.87ms Time], IncrementalHoareTripleChecker [2 Valid, 2234 Invalid, 1 Unknown, 0 Unchecked, 4040.36ms Time] [2021-11-04 14:15:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-11-04 14:15:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2021-11-04 14:15:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 911 states have (on average 1.2634467618002196) internal successors, (1151), 979 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1151 transitions. [2021-11-04 14:15:10,958 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1151 transitions. Word has length 53 [2021-11-04 14:15:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:10,958 INFO L470 AbstractCegarLoop]: Abstraction has 980 states and 1151 transitions. [2021-11-04 14:15:10,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1151 transitions. [2021-11-04 14:15:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 14:15:10,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:10,961 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-04 14:15:10,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 14:15:10,961 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash -675645703, now seen corresponding path program 1 times [2021-11-04 14:15:10,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:10,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842831584] [2021-11-04 14:15:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:10,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:11,166 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-04 14:15:11,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:11,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842831584] [2021-11-04 14:15:11,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842831584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:11,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:11,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:15:11,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779708658] [2021-11-04 14:15:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:11,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:15:11,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:15:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:11,168 INFO L87 Difference]: Start difference. First operand 980 states and 1151 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:13,189 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:16,725 INFO L93 Difference]: Finished difference Result 2506 states and 2945 transitions. [2021-11-04 14:15:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:15:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-04 14:15:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:16,729 INFO L225 Difference]: With dead ends: 2506 [2021-11-04 14:15:16,729 INFO L226 Difference]: Without dead ends: 1579 [2021-11-04 14:15:16,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.25ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 14:15:16,731 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3244 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4867.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.88ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5368.41ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:16,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3244 Valid, 0 Invalid, 3384 Unknown, 0 Unchecked, 13.88ms Time], IncrementalHoareTripleChecker [26 Valid, 3357 Invalid, 1 Unknown, 0 Unchecked, 5368.41ms Time] [2021-11-04 14:15:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2021-11-04 14:15:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 980. [2021-11-04 14:15:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 911 states have (on average 1.2546652030735455) internal successors, (1143), 979 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1143 transitions. [2021-11-04 14:15:16,770 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1143 transitions. Word has length 54 [2021-11-04 14:15:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:16,770 INFO L470 AbstractCegarLoop]: Abstraction has 980 states and 1143 transitions. [2021-11-04 14:15:16,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1143 transitions. [2021-11-04 14:15:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 14:15:16,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:16,771 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-04 14:15:16,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 14:15:16,771 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:16,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash -675586121, now seen corresponding path program 1 times [2021-11-04 14:15:16,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:16,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254843279] [2021-11-04 14:15:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:16,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:16,865 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-04 14:15:16,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:16,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254843279] [2021-11-04 14:15:16,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254843279] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:16,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:16,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:15:16,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899688537] [2021-11-04 14:15:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:16,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:16,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:16,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:16,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:16,867 INFO L87 Difference]: Start difference. First operand 980 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:18,888 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:22,473 INFO L93 Difference]: Finished difference Result 1585 states and 1850 transitions. [2021-11-04 14:15:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:15:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-04 14:15:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:22,477 INFO L225 Difference]: With dead ends: 1585 [2021-11-04 14:15:22,478 INFO L226 Difference]: Without dead ends: 1569 [2021-11-04 14:15:22,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.56ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:22,479 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2106 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4864.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.66ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5404.53ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:22,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2106 Valid, 0 Invalid, 3393 Unknown, 0 Unchecked, 16.66ms Time], IncrementalHoareTripleChecker [26 Valid, 3366 Invalid, 1 Unknown, 0 Unchecked, 5404.53ms Time] [2021-11-04 14:15:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2021-11-04 14:15:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 964. [2021-11-04 14:15:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 903 states have (on average 1.248062015503876) internal successors, (1127), 963 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1127 transitions. [2021-11-04 14:15:22,520 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1127 transitions. Word has length 54 [2021-11-04 14:15:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:22,520 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1127 transitions. [2021-11-04 14:15:22,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1127 transitions. [2021-11-04 14:15:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-04 14:15:22,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:22,521 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-04 14:15:22,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 14:15:22,521 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1078199877, now seen corresponding path program 1 times [2021-11-04 14:15:22,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:22,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002649092] [2021-11-04 14:15:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:22,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:22,624 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-04 14:15:22,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:22,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002649092] [2021-11-04 14:15:22,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002649092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:22,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:22,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:22,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002407404] [2021-11-04 14:15:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:22,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:22,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:22,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:22,627 INFO L87 Difference]: Start difference. First operand 964 states and 1127 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 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-04 14:15:24,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:26,897 INFO L93 Difference]: Finished difference Result 964 states and 1127 transitions. [2021-11-04 14:15:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 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-04 14:15:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:26,900 INFO L225 Difference]: With dead ends: 964 [2021-11-04 14:15:26,900 INFO L226 Difference]: Without dead ends: 960 [2021-11-04 14:15:26,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.36ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:26,902 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1127 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3767.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.53ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4134.59ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:26,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 0 Invalid, 2189 Unknown, 0 Unchecked, 4.53ms Time], IncrementalHoareTripleChecker [2 Valid, 2186 Invalid, 1 Unknown, 0 Unchecked, 4134.59ms Time] [2021-11-04 14:15:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-11-04 14:15:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2021-11-04 14:15:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 901 states have (on average 1.246392896781354) internal successors, (1123), 959 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1123 transitions. [2021-11-04 14:15:26,941 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1123 transitions. Word has length 55 [2021-11-04 14:15:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:26,941 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1123 transitions. [2021-11-04 14:15:26,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 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-04 14:15:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1123 transitions. [2021-11-04 14:15:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-04 14:15:26,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:26,942 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-04 14:15:26,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 14:15:26,943 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1062795009, now seen corresponding path program 1 times [2021-11-04 14:15:26,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:26,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44911297] [2021-11-04 14:15:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:26,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:15:27,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:27,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44911297] [2021-11-04 14:15:27,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44911297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:27,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:27,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:27,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466861586] [2021-11-04 14:15:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:27,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:27,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:27,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:27,041 INFO L87 Difference]: Start difference. First operand 960 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 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-04 14:15:29,061 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:31,279 INFO L93 Difference]: Finished difference Result 960 states and 1123 transitions. [2021-11-04 14:15:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 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-04 14:15:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:31,282 INFO L225 Difference]: With dead ends: 960 [2021-11-04 14:15:31,282 INFO L226 Difference]: Without dead ends: 956 [2021-11-04 14:15:31,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.79ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:31,282 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1113 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3742.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4092.83ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:31,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1113 Valid, 0 Invalid, 2189 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [2 Valid, 2186 Invalid, 1 Unknown, 0 Unchecked, 4092.83ms Time] [2021-11-04 14:15:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-11-04 14:15:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2021-11-04 14:15:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 899 states have (on average 1.2447163515016686) internal successors, (1119), 955 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1119 transitions. [2021-11-04 14:15:31,320 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1119 transitions. Word has length 57 [2021-11-04 14:15:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:31,320 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1119 transitions. [2021-11-04 14:15:31,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 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-04 14:15:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1119 transitions. [2021-11-04 14:15:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-04 14:15:31,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:31,321 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-04 14:15:31,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 14:15:31,321 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash -165297218, now seen corresponding path program 1 times [2021-11-04 14:15:31,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:31,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090009769] [2021-11-04 14:15:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:31,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:31,409 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-04 14:15:31,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:31,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090009769] [2021-11-04 14:15:31,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090009769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:31,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:31,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 14:15:31,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840307800] [2021-11-04 14:15:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:31,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 14:15:31,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 14:15:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 14:15:31,412 INFO L87 Difference]: Start difference. First operand 956 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 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-04 14:15:33,432 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:34,880 INFO L93 Difference]: Finished difference Result 1831 states and 2152 transitions. [2021-11-04 14:15:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 14:15:34,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 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-04 14:15:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:34,883 INFO L225 Difference]: With dead ends: 1831 [2021-11-04 14:15:34,883 INFO L226 Difference]: Without dead ends: 932 [2021-11-04 14:15:34,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 14:15:34,884 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1033 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3095.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.29ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3386.56ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:34,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1033 Valid, 0 Invalid, 1094 Unknown, 0 Unchecked, 1.29ms Time], IncrementalHoareTripleChecker [7 Valid, 1086 Invalid, 1 Unknown, 0 Unchecked, 3386.56ms Time] [2021-11-04 14:15:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-11-04 14:15:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2021-11-04 14:15:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 883 states have (on average 1.2310305775764439) internal successors, (1087), 931 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1087 transitions. [2021-11-04 14:15:34,945 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1087 transitions. Word has length 57 [2021-11-04 14:15:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:34,945 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1087 transitions. [2021-11-04 14:15:34,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 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-04 14:15:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1087 transitions. [2021-11-04 14:15:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-04 14:15:34,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:34,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:15:34,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 14:15:34,946 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 856381603, now seen corresponding path program 1 times [2021-11-04 14:15:34,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:34,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483802926] [2021-11-04 14:15:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:34,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:35,049 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-04 14:15:35,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:35,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483802926] [2021-11-04 14:15:35,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483802926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:35,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:35,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:35,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018974731] [2021-11-04 14:15:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:35,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:35,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:35,052 INFO L87 Difference]: Start difference. First operand 932 states and 1087 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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-04 14:15:37,072 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:39,193 INFO L93 Difference]: Finished difference Result 932 states and 1087 transitions. [2021-11-04 14:15:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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-04 14:15:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:39,196 INFO L225 Difference]: With dead ends: 932 [2021-11-04 14:15:39,196 INFO L226 Difference]: Without dead ends: 928 [2021-11-04 14:15:39,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.01ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:39,197 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1067 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3700.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.81ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4046.84ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:39,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 0 Invalid, 2125 Unknown, 0 Unchecked, 3.81ms Time], IncrementalHoareTripleChecker [2 Valid, 2122 Invalid, 1 Unknown, 0 Unchecked, 4046.84ms Time] [2021-11-04 14:15:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-11-04 14:15:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2021-11-04 14:15:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 881 states have (on average 1.2292849035187288) internal successors, (1083), 927 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1083 transitions. [2021-11-04 14:15:39,240 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1083 transitions. Word has length 59 [2021-11-04 14:15:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:39,241 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 1083 transitions. [2021-11-04 14:15:39,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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-04 14:15:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1083 transitions. [2021-11-04 14:15:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-04 14:15:39,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:39,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:15:39,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 14:15:39,242 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2077345727, now seen corresponding path program 1 times [2021-11-04 14:15:39,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:39,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336486044] [2021-11-04 14:15:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:39,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:39,404 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-04 14:15:39,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:39,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336486044] [2021-11-04 14:15:39,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336486044] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:39,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:39,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:39,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493461492] [2021-11-04 14:15:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:39,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:39,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:39,406 INFO L87 Difference]: Start difference. First operand 928 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:40,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:42,958 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-04 14:15:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:45,453 INFO L93 Difference]: Finished difference Result 1203 states and 1379 transitions. [2021-11-04 14:15:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:15:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-04 14:15:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:45,456 INFO L225 Difference]: With dead ends: 1203 [2021-11-04 14:15:45,456 INFO L226 Difference]: Without dead ends: 1197 [2021-11-04 14:15:45,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.37ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:45,457 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1618 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5413.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.81ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5888.62ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:45,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1618 Valid, 0 Invalid, 2147 Unknown, 0 Unchecked, 10.81ms Time], IncrementalHoareTripleChecker [15 Valid, 2131 Invalid, 1 Unknown, 0 Unchecked, 5888.62ms Time] [2021-11-04 14:15:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-11-04 14:15:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 922. [2021-11-04 14:15:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 878 states have (on average 1.2266514806378133) internal successors, (1077), 921 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1077 transitions. [2021-11-04 14:15:45,498 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1077 transitions. Word has length 60 [2021-11-04 14:15:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:45,498 INFO L470 AbstractCegarLoop]: Abstraction has 922 states and 1077 transitions. [2021-11-04 14:15:45,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1077 transitions. [2021-11-04 14:15:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-04 14:15:45,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:45,499 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] [2021-11-04 14:15:45,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 14:15:45,499 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:45,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1650831193, now seen corresponding path program 1 times [2021-11-04 14:15:45,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:45,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924243575] [2021-11-04 14:15:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:45,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:45,580 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-04 14:15:45,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:45,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924243575] [2021-11-04 14:15:45,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924243575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:45,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:45,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:45,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246282060] [2021-11-04 14:15:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:45,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:45,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:45,582 INFO L87 Difference]: Start difference. First operand 922 states and 1077 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:47,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:49,540 INFO L93 Difference]: Finished difference Result 922 states and 1077 transitions. [2021-11-04 14:15:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:49,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-11-04 14:15:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:49,551 INFO L225 Difference]: With dead ends: 922 [2021-11-04 14:15:49,551 INFO L226 Difference]: Without dead ends: 918 [2021-11-04 14:15:49,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.94ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:49,552 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1047 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3542.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.80ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3854.72ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:49,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1047 Valid, 0 Invalid, 2113 Unknown, 0 Unchecked, 5.80ms Time], IncrementalHoareTripleChecker [2 Valid, 2110 Invalid, 1 Unknown, 0 Unchecked, 3854.72ms Time] [2021-11-04 14:15:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-11-04 14:15:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2021-11-04 14:15:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 876 states have (on average 1.2248858447488584) internal successors, (1073), 917 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1073 transitions. [2021-11-04 14:15:49,594 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1073 transitions. Word has length 61 [2021-11-04 14:15:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:49,594 INFO L470 AbstractCegarLoop]: Abstraction has 918 states and 1073 transitions. [2021-11-04 14:15:49,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1073 transitions. [2021-11-04 14:15:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-04 14:15:49,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:49,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:15:49,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 14:15:49,595 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:49,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1605674741, now seen corresponding path program 1 times [2021-11-04 14:15:49,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:49,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862473177] [2021-11-04 14:15:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:49,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:49,666 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-04 14:15:49,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:49,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862473177] [2021-11-04 14:15:49,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862473177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:49,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:49,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:49,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481401902] [2021-11-04 14:15:49,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:49,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:49,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:49,669 INFO L87 Difference]: Start difference. First operand 918 states and 1073 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:51,708 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-04 14:15:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:53,588 INFO L93 Difference]: Finished difference Result 918 states and 1073 transitions. [2021-11-04 14:15:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-04 14:15:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:53,598 INFO L225 Difference]: With dead ends: 918 [2021-11-04 14:15:53,598 INFO L226 Difference]: Without dead ends: 914 [2021-11-04 14:15:53,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:53,599 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1033 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3507.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.46ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3829.67ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:53,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1033 Valid, 0 Invalid, 2113 Unknown, 0 Unchecked, 3.46ms Time], IncrementalHoareTripleChecker [2 Valid, 2110 Invalid, 1 Unknown, 0 Unchecked, 3829.67ms Time] [2021-11-04 14:15:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-11-04 14:15:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2021-11-04 14:15:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 874 states have (on average 1.223112128146453) internal successors, (1069), 913 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1069 transitions. [2021-11-04 14:15:53,641 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1069 transitions. Word has length 63 [2021-11-04 14:15:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:53,641 INFO L470 AbstractCegarLoop]: Abstraction has 914 states and 1069 transitions. [2021-11-04 14:15:53,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1069 transitions. [2021-11-04 14:15:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 14:15:53,642 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:53,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:15:53,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 14:15:53,642 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1159996977, now seen corresponding path program 1 times [2021-11-04 14:15:53,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:53,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686889500] [2021-11-04 14:15:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:53,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:53,717 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-04 14:15:53,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:53,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686889500] [2021-11-04 14:15:53,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686889500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:53,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:53,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:15:53,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897711764] [2021-11-04 14:15:53,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:53,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:15:53,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:15:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:15:53,719 INFO L87 Difference]: Start difference. First operand 914 states and 1069 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 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-04 14:15:55,740 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:15:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:15:57,601 INFO L93 Difference]: Finished difference Result 914 states and 1069 transitions. [2021-11-04 14:15:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:15:57,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 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-04 14:15:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:15:57,604 INFO L225 Difference]: With dead ends: 914 [2021-11-04 14:15:57,604 INFO L226 Difference]: Without dead ends: 910 [2021-11-04 14:15:57,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.79ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:57,605 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1019 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3458.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.22ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3786.12ms IncrementalHoareTripleChecker+Time [2021-11-04 14:15:57,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1019 Valid, 0 Invalid, 2113 Unknown, 0 Unchecked, 3.22ms Time], IncrementalHoareTripleChecker [2 Valid, 2110 Invalid, 1 Unknown, 0 Unchecked, 3786.12ms Time] [2021-11-04 14:15:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-11-04 14:15:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2021-11-04 14:15:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 872 states have (on average 1.2213302752293578) internal successors, (1065), 909 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1065 transitions. [2021-11-04 14:15:57,647 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1065 transitions. Word has length 65 [2021-11-04 14:15:57,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:15:57,648 INFO L470 AbstractCegarLoop]: Abstraction has 910 states and 1065 transitions. [2021-11-04 14:15:57,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 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-04 14:15:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1065 transitions. [2021-11-04 14:15:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-04 14:15:57,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:15:57,648 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] [2021-11-04 14:15:57,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 14:15:57,648 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:15:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:15:57,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2089874634, now seen corresponding path program 1 times [2021-11-04 14:15:57,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:15:57,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895694884] [2021-11-04 14:15:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:15:57,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:15:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:15:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:15:57,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:15:57,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895694884] [2021-11-04 14:15:57,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895694884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:15:57,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:15:57,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:15:57,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35369555] [2021-11-04 14:15:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:15:57,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:15:57,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:15:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:15:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:15:57,787 INFO L87 Difference]: Start difference. First operand 910 states and 1065 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:15:59,807 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:03,776 INFO L93 Difference]: Finished difference Result 2210 states and 2602 transitions. [2021-11-04 14:16:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:16:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-04 14:16:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:03,781 INFO L225 Difference]: With dead ends: 2210 [2021-11-04 14:16:03,781 INFO L226 Difference]: Without dead ends: 1704 [2021-11-04 14:16:03,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.11ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 14:16:03,782 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1967 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 4664 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5199.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1967 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.40ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4664 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5773.11ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:03,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1967 Valid, 0 Invalid, 4671 Unknown, 0 Unchecked, 8.40ms Time], IncrementalHoareTripleChecker [6 Valid, 4664 Invalid, 1 Unknown, 0 Unchecked, 5773.11ms Time] [2021-11-04 14:16:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2021-11-04 14:16:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 913. [2021-11-04 14:16:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 875 states have (on average 1.2205714285714286) internal successors, (1068), 912 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1068 transitions. [2021-11-04 14:16:03,848 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1068 transitions. Word has length 66 [2021-11-04 14:16:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:03,848 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1068 transitions. [2021-11-04 14:16:03,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1068 transitions. [2021-11-04 14:16:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-04 14:16:03,849 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:03,849 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] [2021-11-04 14:16:03,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-04 14:16:03,849 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1934572275, now seen corresponding path program 1 times [2021-11-04 14:16:03,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:03,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582624143] [2021-11-04 14:16:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:03,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:03,948 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-04 14:16:03,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:03,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582624143] [2021-11-04 14:16:03,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582624143] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:03,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:03,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:16:03,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318772658] [2021-11-04 14:16:03,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:03,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:16:03,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:03,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:16:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:16:03,950 INFO L87 Difference]: Start difference. First operand 913 states and 1068 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:05,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:07,761 INFO L93 Difference]: Finished difference Result 913 states and 1068 transitions. [2021-11-04 14:16:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:16:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-04 14:16:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:07,764 INFO L225 Difference]: With dead ends: 913 [2021-11-04 14:16:07,764 INFO L226 Difference]: Without dead ends: 909 [2021-11-04 14:16:07,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:16:07,764 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1005 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3391.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.02ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3717.40ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:07,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1005 Valid, 0 Invalid, 2113 Unknown, 0 Unchecked, 3.02ms Time], IncrementalHoareTripleChecker [2 Valid, 2110 Invalid, 1 Unknown, 0 Unchecked, 3717.40ms Time] [2021-11-04 14:16:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-11-04 14:16:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2021-11-04 14:16:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 873 states have (on average 1.2187857961053838) internal successors, (1064), 908 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1064 transitions. [2021-11-04 14:16:07,825 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1064 transitions. Word has length 67 [2021-11-04 14:16:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:07,825 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1064 transitions. [2021-11-04 14:16:07,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1064 transitions. [2021-11-04 14:16:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-04 14:16:07,826 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:07,826 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] [2021-11-04 14:16:07,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-04 14:16:07,827 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash 822151637, now seen corresponding path program 1 times [2021-11-04 14:16:07,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:07,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127698303] [2021-11-04 14:16:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:07,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:07,908 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-04 14:16:07,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:07,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127698303] [2021-11-04 14:16:07,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127698303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:07,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:07,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:16:07,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898206615] [2021-11-04 14:16:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:07,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 14:16:07,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 14:16:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 14:16:07,911 INFO L87 Difference]: Start difference. First operand 909 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:09,930 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:11,227 INFO L93 Difference]: Finished difference Result 1596 states and 1871 transitions. [2021-11-04 14:16:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 14:16:11,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-11-04 14:16:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:11,230 INFO L225 Difference]: With dead ends: 1596 [2021-11-04 14:16:11,230 INFO L226 Difference]: Without dead ends: 910 [2021-11-04 14:16:11,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.60ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 14:16:11,232 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 984 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2970.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.41ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3220.02ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:11,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [984 Valid, 0 Invalid, 1116 Unknown, 0 Unchecked, 1.41ms Time], IncrementalHoareTripleChecker [2 Valid, 1113 Invalid, 1 Unknown, 0 Unchecked, 3220.02ms Time] [2021-11-04 14:16:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-11-04 14:16:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2021-11-04 14:16:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 871 states have (on average 1.2169919632606199) internal successors, (1060), 905 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1060 transitions. [2021-11-04 14:16:11,302 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1060 transitions. Word has length 68 [2021-11-04 14:16:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:11,302 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 1060 transitions. [2021-11-04 14:16:11,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1060 transitions. [2021-11-04 14:16:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-04 14:16:11,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:11,303 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-04 14:16:11,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-04 14:16:11,303 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:11,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash -596712329, now seen corresponding path program 1 times [2021-11-04 14:16:11,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:11,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590045565] [2021-11-04 14:16:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:11,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:11,387 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-04 14:16:11,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:11,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590045565] [2021-11-04 14:16:11,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590045565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:11,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:11,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:16:11,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453774352] [2021-11-04 14:16:11,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:11,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:16:11,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:16:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:16:11,389 INFO L87 Difference]: Start difference. First operand 906 states and 1060 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04 14:16:13,412 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:16,262 INFO L93 Difference]: Finished difference Result 1682 states and 1973 transitions. [2021-11-04 14:16:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:16:16,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04 14:16:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:16,266 INFO L225 Difference]: With dead ends: 1682 [2021-11-04 14:16:16,266 INFO L226 Difference]: Without dead ends: 1590 [2021-11-04 14:16:16,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.14ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:16:16,267 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 979 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4258.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.65ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4699.20ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:16,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 0 Invalid, 3082 Unknown, 0 Unchecked, 5.65ms Time], IncrementalHoareTripleChecker [2 Valid, 3079 Invalid, 1 Unknown, 0 Unchecked, 4699.20ms Time] [2021-11-04 14:16:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-11-04 14:16:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1512. [2021-11-04 14:16:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1477 states have (on average 1.2383209207853758) internal successors, (1829), 1511 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1829 transitions. [2021-11-04 14:16:16,369 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1829 transitions. Word has length 69 [2021-11-04 14:16:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:16,369 INFO L470 AbstractCegarLoop]: Abstraction has 1512 states and 1829 transitions. [2021-11-04 14:16:16,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04 14:16:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1829 transitions. [2021-11-04 14:16:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-04 14:16:16,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:16,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:16:16,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-04 14:16:16,371 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:16,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -714461748, now seen corresponding path program 1 times [2021-11-04 14:16:16,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:16,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360288741] [2021-11-04 14:16:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:16,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:16:16,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:16,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360288741] [2021-11-04 14:16:16,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360288741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:16,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:16,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 14:16:16,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84819711] [2021-11-04 14:16:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:16,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:16:16,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:16:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:16:16,498 INFO L87 Difference]: Start difference. First operand 1512 states and 1829 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:18,519 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:21,910 INFO L93 Difference]: Finished difference Result 2813 states and 3387 transitions. [2021-11-04 14:16:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:16:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-04 14:16:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:21,915 INFO L225 Difference]: With dead ends: 2813 [2021-11-04 14:16:21,915 INFO L226 Difference]: Without dead ends: 2803 [2021-11-04 14:16:21,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:16:21,916 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1942 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4595.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.63ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5096.26ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:21,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1942 Valid, 0 Invalid, 2838 Unknown, 0 Unchecked, 10.63ms Time], IncrementalHoareTripleChecker [27 Valid, 2810 Invalid, 1 Unknown, 0 Unchecked, 5096.26ms Time] [2021-11-04 14:16:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2021-11-04 14:16:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 1870. [2021-11-04 14:16:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1836 states have (on average 1.2282135076252723) internal successors, (2255), 1869 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2255 transitions. [2021-11-04 14:16:22,042 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2255 transitions. Word has length 71 [2021-11-04 14:16:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:22,042 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2255 transitions. [2021-11-04 14:16:22,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2255 transitions. [2021-11-04 14:16:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-04 14:16:22,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:22,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:16:22,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-04 14:16:22,043 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:22,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash -714476643, now seen corresponding path program 1 times [2021-11-04 14:16:22,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:22,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447970114] [2021-11-04 14:16:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:22,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:16:22,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:22,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447970114] [2021-11-04 14:16:22,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447970114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:22,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:22,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:16:22,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945480629] [2021-11-04 14:16:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:22,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:16:22,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:16:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:16:22,239 INFO L87 Difference]: Start difference. First operand 1870 states and 2255 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:24,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:28,065 INFO L93 Difference]: Finished difference Result 2973 states and 3613 transitions. [2021-11-04 14:16:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:16:28,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-04 14:16:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:28,070 INFO L225 Difference]: With dead ends: 2973 [2021-11-04 14:16:28,070 INFO L226 Difference]: Without dead ends: 2961 [2021-11-04 14:16:28,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.69ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:16:28,072 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 667 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 3770 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4991.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.93ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3770 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5504.77ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:28,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 0 Invalid, 3783 Unknown, 0 Unchecked, 7.93ms Time], IncrementalHoareTripleChecker [12 Valid, 3770 Invalid, 1 Unknown, 0 Unchecked, 5504.77ms Time] [2021-11-04 14:16:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2021-11-04 14:16:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1858. [2021-11-04 14:16:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1830 states have (on average 1.2191256830601094) internal successors, (2231), 1857 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2231 transitions. [2021-11-04 14:16:28,216 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2231 transitions. Word has length 71 [2021-11-04 14:16:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:28,216 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 2231 transitions. [2021-11-04 14:16:28,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2231 transitions. [2021-11-04 14:16:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-04 14:16:28,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:28,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:16:28,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-04 14:16:28,218 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1153735557, now seen corresponding path program 1 times [2021-11-04 14:16:28,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:28,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993955406] [2021-11-04 14:16:28,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:28,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:28,323 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-04 14:16:28,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:28,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993955406] [2021-11-04 14:16:28,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993955406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:28,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:28,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:16:28,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554849929] [2021-11-04 14:16:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:28,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:16:28,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:16:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:16:28,325 INFO L87 Difference]: Start difference. First operand 1858 states and 2231 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:30,345 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:32,253 INFO L93 Difference]: Finished difference Result 3403 states and 4095 transitions. [2021-11-04 14:16:32,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:16:32,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-04 14:16:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:32,257 INFO L225 Difference]: With dead ends: 3403 [2021-11-04 14:16:32,257 INFO L226 Difference]: Without dead ends: 1859 [2021-11-04 14:16:32,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.33ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:16:32,260 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2930 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3398.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.87ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3682.37ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:32,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2930 Valid, 0 Invalid, 1216 Unknown, 0 Unchecked, 7.87ms Time], IncrementalHoareTripleChecker [9 Valid, 1206 Invalid, 1 Unknown, 0 Unchecked, 3682.37ms Time] [2021-11-04 14:16:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2021-11-04 14:16:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1854. [2021-11-04 14:16:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1827 states have (on average 1.217296113847838) internal successors, (2224), 1853 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2224 transitions. [2021-11-04 14:16:32,405 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2224 transitions. Word has length 71 [2021-11-04 14:16:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:32,405 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 2224 transitions. [2021-11-04 14:16:32,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2224 transitions. [2021-11-04 14:16:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-04 14:16:32,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:32,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:16:32,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-04 14:16:32,407 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 528139423, now seen corresponding path program 1 times [2021-11-04 14:16:32,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:32,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497342589] [2021-11-04 14:16:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:32,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:32,557 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-04 14:16:32,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:32,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497342589] [2021-11-04 14:16:32,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497342589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:32,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:32,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 14:16:32,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897021678] [2021-11-04 14:16:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:32,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 14:16:32,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 14:16:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:16:32,559 INFO L87 Difference]: Start difference. First operand 1854 states and 2224 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:34,580 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:16:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:16:42,686 INFO L93 Difference]: Finished difference Result 10892 states and 13159 transitions. [2021-11-04 14:16:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-04 14:16:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-04 14:16:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:16:42,700 INFO L225 Difference]: With dead ends: 10892 [2021-11-04 14:16:42,701 INFO L226 Difference]: Without dead ends: 9107 [2021-11-04 14:16:42,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 85.32ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-04 14:16:42,704 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8479 mSDsluCounter, 6198 mSDsCounter, 0 mSdLazyCounter, 8060 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8093.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8479 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.77ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 8060 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9080.07ms IncrementalHoareTripleChecker+Time [2021-11-04 14:16:42,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8479 Valid, 0 Invalid, 8079 Unknown, 0 Unchecked, 22.77ms Time], IncrementalHoareTripleChecker [18 Valid, 8060 Invalid, 1 Unknown, 0 Unchecked, 9080.07ms Time] [2021-11-04 14:16:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9107 states. [2021-11-04 14:16:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9107 to 1858. [2021-11-04 14:16:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1831 states have (on average 1.216821409066084) internal successors, (2228), 1857 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2228 transitions. [2021-11-04 14:16:42,905 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2228 transitions. Word has length 76 [2021-11-04 14:16:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:16:42,906 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 2228 transitions. [2021-11-04 14:16:42,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2228 transitions. [2021-11-04 14:16:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-04 14:16:42,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:16:42,907 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] [2021-11-04 14:16:42,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-04 14:16:42,907 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:16:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:16:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 391148030, now seen corresponding path program 1 times [2021-11-04 14:16:42,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:16:42,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544770513] [2021-11-04 14:16:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:16:42,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:16:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:16:43,245 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-04 14:16:43,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:16:43,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544770513] [2021-11-04 14:16:43,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544770513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:16:43,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:16:43,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-04 14:16:43,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564878959] [2021-11-04 14:16:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:16:43,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-04 14:16:43,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:16:43,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-04 14:16:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-04 14:16:43,247 INFO L87 Difference]: Start difference. First operand 1858 states and 2228 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:16:45,288 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-04 14:17:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:17:02,415 INFO L93 Difference]: Finished difference Result 12815 states and 15456 transitions. [2021-11-04 14:17:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-04 14:17:02,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-11-04 14:17:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:17:02,435 INFO L225 Difference]: With dead ends: 12815 [2021-11-04 14:17:02,435 INFO L226 Difference]: Without dead ends: 11237 [2021-11-04 14:17:02,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 320.69ms TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2021-11-04 14:17:02,440 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8257 mSDsluCounter, 11597 mSDsCounter, 0 mSdLazyCounter, 15981 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15133.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 62.20ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 15981 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16995.51ms IncrementalHoareTripleChecker+Time [2021-11-04 14:17:02,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8257 Valid, 0 Invalid, 16012 Unknown, 0 Unchecked, 62.20ms Time], IncrementalHoareTripleChecker [30 Valid, 15981 Invalid, 1 Unknown, 0 Unchecked, 16995.51ms Time] [2021-11-04 14:17:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11237 states. [2021-11-04 14:17:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11237 to 1858. [2021-11-04 14:17:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1831 states have (on average 1.2157291097760787) internal successors, (2226), 1857 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2226 transitions. [2021-11-04 14:17:02,714 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2226 transitions. Word has length 81 [2021-11-04 14:17:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:17:02,714 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 2226 transitions. [2021-11-04 14:17:02,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2226 transitions. [2021-11-04 14:17:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-04 14:17:02,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:17:02,715 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-04 14:17:02,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-04 14:17:02,716 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:17:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:17:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1878031298, now seen corresponding path program 1 times [2021-11-04 14:17:02,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:17:02,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314338396] [2021-11-04 14:17:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:17:02,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:17:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:17:02,841 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-04 14:17:02,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:17:02,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314338396] [2021-11-04 14:17:02,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314338396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:17:02,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:17:02,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:17:02,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199058143] [2021-11-04 14:17:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:17:02,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:17:02,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:17:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:17:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:17:02,843 INFO L87 Difference]: Start difference. First operand 1858 states and 2226 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-04 14:17:04,447 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:17:05,962 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:17:08,034 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-04 14:17:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:17:12,812 INFO L93 Difference]: Finished difference Result 4030 states and 4935 transitions. [2021-11-04 14:17:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:17:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-04 14:17:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:17:12,818 INFO L225 Difference]: With dead ends: 4030 [2021-11-04 14:17:12,818 INFO L226 Difference]: Without dead ends: 4016 [2021-11-04 14:17:12,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.50ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:17:12,819 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1461 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 4901 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8578.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.82ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4901 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9354.08ms IncrementalHoareTripleChecker+Time [2021-11-04 14:17:12,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1461 Valid, 0 Invalid, 4918 Unknown, 0 Unchecked, 7.82ms Time], IncrementalHoareTripleChecker [16 Valid, 4901 Invalid, 1 Unknown, 0 Unchecked, 9354.08ms Time] [2021-11-04 14:17:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2021-11-04 14:17:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2266. [2021-11-04 14:17:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2241 states have (on average 1.2396251673360108) internal successors, (2778), 2265 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 2778 transitions. [2021-11-04 14:17:13,092 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 2778 transitions. Word has length 83 [2021-11-04 14:17:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:17:13,092 INFO L470 AbstractCegarLoop]: Abstraction has 2266 states and 2778 transitions. [2021-11-04 14:17:13,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-04 14:17:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2778 transitions. [2021-11-04 14:17:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-04 14:17:13,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:17:13,093 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-04 14:17:13,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-04 14:17:13,094 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:17:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:17:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1715871420, now seen corresponding path program 1 times [2021-11-04 14:17:13,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:17:13,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016622011] [2021-11-04 14:17:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:17:13,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:17:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:17:13,182 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-04 14:17:13,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:17:13,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016622011] [2021-11-04 14:17:13,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016622011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:17:13,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:17:13,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:17:13,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836828314] [2021-11-04 14:17:13,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:17:13,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:17:13,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:17:13,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:17:13,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:17:13,184 INFO L87 Difference]: Start difference. First operand 2266 states and 2778 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-04 14:17:15,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:17:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:17:22,345 INFO L93 Difference]: Finished difference Result 9900 states and 12302 transitions. [2021-11-04 14:17:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:17:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-04 14:17:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:17:22,354 INFO L225 Difference]: With dead ends: 9900 [2021-11-04 14:17:22,354 INFO L226 Difference]: Without dead ends: 8223 [2021-11-04 14:17:22,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.65ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 14:17:22,357 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2677 mSDsluCounter, 5456 mSDsCounter, 0 mSdLazyCounter, 7787 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7106.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2677 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.10ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7787 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7960.81ms IncrementalHoareTripleChecker+Time [2021-11-04 14:17:22,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2677 Valid, 0 Invalid, 7791 Unknown, 0 Unchecked, 12.10ms Time], IncrementalHoareTripleChecker [3 Valid, 7787 Invalid, 1 Unknown, 0 Unchecked, 7960.81ms Time] [2021-11-04 14:17:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2021-11-04 14:17:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 2208. [2021-11-04 14:17:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2184 states have (on average 1.2376373626373627) internal successors, (2703), 2207 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2703 transitions. [2021-11-04 14:17:22,670 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2703 transitions. Word has length 83 [2021-11-04 14:17:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:17:22,671 INFO L470 AbstractCegarLoop]: Abstraction has 2208 states and 2703 transitions. [2021-11-04 14:17:22,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-04 14:17:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2703 transitions. [2021-11-04 14:17:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-04 14:17:22,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:17:22,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:17:22,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-04 14:17:22,672 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:17:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:17:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 62014828, now seen corresponding path program 1 times [2021-11-04 14:17:22,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:17:22,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232440738] [2021-11-04 14:17:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:17:22,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:17:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:17:23,305 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-04 14:17:23,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:17:23,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232440738] [2021-11-04 14:17:23,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232440738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:17:23,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:17:23,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:17:23,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926619106] [2021-11-04 14:17:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:17:23,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:17:23,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:17:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:17:23,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:17:23,307 INFO L87 Difference]: Start difference. First operand 2208 states and 2703 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:25,327 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:17:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:17:29,110 INFO L93 Difference]: Finished difference Result 6064 states and 7468 transitions. [2021-11-04 14:17:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:17:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-04 14:17:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:17:29,113 INFO L225 Difference]: With dead ends: 6064 [2021-11-04 14:17:29,113 INFO L226 Difference]: Without dead ends: 3868 [2021-11-04 14:17:29,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.03ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 14:17:29,115 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1272 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 4123 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4694.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.44ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5185.03ms IncrementalHoareTripleChecker+Time [2021-11-04 14:17:29,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 0 Invalid, 4124 Unknown, 0 Unchecked, 6.44ms Time], IncrementalHoareTripleChecker [0 Valid, 4123 Invalid, 1 Unknown, 0 Unchecked, 5185.03ms Time] [2021-11-04 14:17:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2021-11-04 14:17:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 2211. [2021-11-04 14:17:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2187 states have (on average 1.2373113854595337) internal successors, (2706), 2210 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2706 transitions. [2021-11-04 14:17:29,410 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2706 transitions. Word has length 85 [2021-11-04 14:17:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:17:29,410 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 2706 transitions. [2021-11-04 14:17:29,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2706 transitions. [2021-11-04 14:17:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-04 14:17:29,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:17:29,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:17:29,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-04 14:17:29,411 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:17:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:17:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 302254574, now seen corresponding path program 1 times [2021-11-04 14:17:29,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:17:29,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878703956] [2021-11-04 14:17:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:17:29,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:17:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:17:29,805 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-04 14:17:29,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:17:29,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878703956] [2021-11-04 14:17:29,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878703956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:17:29,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:17:29,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-04 14:17:29,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251180686] [2021-11-04 14:17:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:17:29,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 14:17:29,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:17:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 14:17:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:17:29,807 INFO L87 Difference]: Start difference. First operand 2211 states and 2706 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:31,827 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:17:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:17:48,477 INFO L93 Difference]: Finished difference Result 12652 states and 15497 transitions. [2021-11-04 14:17:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-04 14:17:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-04 14:17:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:17:48,489 INFO L225 Difference]: With dead ends: 12652 [2021-11-04 14:17:48,489 INFO L226 Difference]: Without dead ends: 11616 [2021-11-04 14:17:48,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 398.16ms TimeCoverageRelationStatistics Valid=327, Invalid=863, Unknown=0, NotChecked=0, Total=1190 [2021-11-04 14:17:48,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7792 mSDsluCounter, 13598 mSDsCounter, 0 mSdLazyCounter, 18349 mSolverCounterSat, 89 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14342.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7792 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 50.98ms SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 18349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16124.65ms IncrementalHoareTripleChecker+Time [2021-11-04 14:17:48,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7792 Valid, 0 Invalid, 18439 Unknown, 0 Unchecked, 50.98ms Time], IncrementalHoareTripleChecker [89 Valid, 18349 Invalid, 1 Unknown, 0 Unchecked, 16124.65ms Time] [2021-11-04 14:17:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11616 states. [2021-11-04 14:17:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11616 to 2220. [2021-11-04 14:17:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 2196 states have (on average 1.2377049180327868) internal successors, (2718), 2219 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2718 transitions. [2021-11-04 14:17:48,867 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2718 transitions. Word has length 85 [2021-11-04 14:17:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:17:48,868 INFO L470 AbstractCegarLoop]: Abstraction has 2220 states and 2718 transitions. [2021-11-04 14:17:48,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:17:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2718 transitions. [2021-11-04 14:17:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-04 14:17:48,868 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:17:48,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:17:48,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-04 14:17:48,869 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:17:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:17:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1401149076, now seen corresponding path program 1 times [2021-11-04 14:17:48,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:17:48,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148930584] [2021-11-04 14:17:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:17:48,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:17:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:17:49,294 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-04 14:17:49,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:17:49,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148930584] [2021-11-04 14:17:49,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148930584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:17:49,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:17:49,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-04 14:17:49,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467336713] [2021-11-04 14:17:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:17:49,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-04 14:17:49,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:17:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-04 14:17:49,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-04 14:17:49,296 INFO L87 Difference]: Start difference. First operand 2220 states and 2718 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 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-04 14:17:51,315 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:18:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:18:13,663 INFO L93 Difference]: Finished difference Result 14950 states and 18236 transitions. [2021-11-04 14:18:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-04 14:18:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 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-04 14:18:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:18:13,681 INFO L225 Difference]: With dead ends: 14950 [2021-11-04 14:18:13,681 INFO L226 Difference]: Without dead ends: 13914 [2021-11-04 14:18:13,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 599.26ms TimeCoverageRelationStatistics Valid=545, Invalid=1525, Unknown=0, NotChecked=0, Total=2070 [2021-11-04 14:18:13,687 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8663 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 22853 mSolverCounterSat, 108 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18506.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8663 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 75.40ms SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 22853 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20636.88ms IncrementalHoareTripleChecker+Time [2021-11-04 14:18:13,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8663 Valid, 0 Invalid, 22962 Unknown, 0 Unchecked, 75.40ms Time], IncrementalHoareTripleChecker [108 Valid, 22853 Invalid, 1 Unknown, 0 Unchecked, 20636.88ms Time] [2021-11-04 14:18:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13914 states. [2021-11-04 14:18:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13914 to 2222. [2021-11-04 14:18:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2198 states have (on average 1.237943585077343) internal successors, (2721), 2221 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2721 transitions. [2021-11-04 14:18:14,128 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2721 transitions. Word has length 86 [2021-11-04 14:18:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:18:14,128 INFO L470 AbstractCegarLoop]: Abstraction has 2222 states and 2721 transitions. [2021-11-04 14:18:14,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 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-04 14:18:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2721 transitions. [2021-11-04 14:18:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-04 14:18:14,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:18:14,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:18:14,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-04 14:18:14,130 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:18:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:18:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1579621603, now seen corresponding path program 1 times [2021-11-04 14:18:14,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:18:14,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009722895] [2021-11-04 14:18:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:18:14,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:18:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:18:14,522 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-04 14:18:14,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:18:14,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009722895] [2021-11-04 14:18:14,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009722895] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:18:14,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:18:14,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-04 14:18:14,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131873628] [2021-11-04 14:18:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:18:14,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 14:18:14,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:18:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 14:18:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:18:14,523 INFO L87 Difference]: Start difference. First operand 2222 states and 2721 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:16,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:18:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:18:39,424 INFO L93 Difference]: Finished difference Result 15752 states and 19435 transitions. [2021-11-04 14:18:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-04 14:18:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-11-04 14:18:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:18:39,441 INFO L225 Difference]: With dead ends: 15752 [2021-11-04 14:18:39,441 INFO L226 Difference]: Without dead ends: 14722 [2021-11-04 14:18:39,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 466.06ms TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2021-11-04 14:18:39,446 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8547 mSDsluCounter, 16337 mSDsCounter, 0 mSdLazyCounter, 22076 mSolverCounterSat, 103 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18728.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8547 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 81.34ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 22076 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20893.52ms IncrementalHoareTripleChecker+Time [2021-11-04 14:18:39,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8547 Valid, 0 Invalid, 22180 Unknown, 0 Unchecked, 81.34ms Time], IncrementalHoareTripleChecker [103 Valid, 22076 Invalid, 1 Unknown, 0 Unchecked, 20893.52ms Time] [2021-11-04 14:18:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14722 states. [2021-11-04 14:18:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14722 to 2252. [2021-11-04 14:18:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2228 states have (on average 1.23967684021544) internal successors, (2762), 2251 states have internal predecessors, (2762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 2762 transitions. [2021-11-04 14:18:39,920 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 2762 transitions. Word has length 87 [2021-11-04 14:18:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:18:39,920 INFO L470 AbstractCegarLoop]: Abstraction has 2252 states and 2762 transitions. [2021-11-04 14:18:39,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2762 transitions. [2021-11-04 14:18:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-04 14:18:39,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:18:39,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:18:39,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-04 14:18:39,927 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:18:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:18:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1863167311, now seen corresponding path program 1 times [2021-11-04 14:18:39,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:18:39,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005455215] [2021-11-04 14:18:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:18:39,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:18:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:18:40,020 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-04 14:18:40,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:18:40,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005455215] [2021-11-04 14:18:40,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005455215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:18:40,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:18:40,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:18:40,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307253987] [2021-11-04 14:18:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:18:40,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:18:40,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:18:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:18:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:18:40,022 INFO L87 Difference]: Start difference. First operand 2252 states and 2762 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:42,042 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:18:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:18:50,714 INFO L93 Difference]: Finished difference Result 9456 states and 11592 transitions. [2021-11-04 14:18:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:18:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-04 14:18:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:18:50,723 INFO L225 Difference]: With dead ends: 9456 [2021-11-04 14:18:50,723 INFO L226 Difference]: Without dead ends: 7837 [2021-11-04 14:18:50,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.29ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 14:18:50,726 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2536 mSDsluCounter, 5113 mSDsCounter, 0 mSdLazyCounter, 7347 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7801.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.29ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8725.06ms IncrementalHoareTripleChecker+Time [2021-11-04 14:18:50,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2536 Valid, 0 Invalid, 7351 Unknown, 0 Unchecked, 17.29ms Time], IncrementalHoareTripleChecker [3 Valid, 7347 Invalid, 1 Unknown, 0 Unchecked, 8725.06ms Time] [2021-11-04 14:18:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2021-11-04 14:18:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 2192. [2021-11-04 14:18:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2170 states have (on average 1.2304147465437787) internal successors, (2670), 2191 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2670 transitions. [2021-11-04 14:18:51,174 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2670 transitions. Word has length 88 [2021-11-04 14:18:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:18:51,175 INFO L470 AbstractCegarLoop]: Abstraction has 2192 states and 2670 transitions. [2021-11-04 14:18:51,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2670 transitions. [2021-11-04 14:18:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-04 14:18:51,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:18:51,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:18:51,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-04 14:18:51,176 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:18:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:18:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2126977819, now seen corresponding path program 1 times [2021-11-04 14:18:51,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:18:51,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628056128] [2021-11-04 14:18:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:18:51,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:18:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:18:51,578 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-04 14:18:51,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:18:51,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628056128] [2021-11-04 14:18:51,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628056128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:18:51,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:18:51,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-04 14:18:51,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994867481] [2021-11-04 14:18:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:18:51,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-04 14:18:51,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:18:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-04 14:18:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-04 14:18:51,579 INFO L87 Difference]: Start difference. First operand 2192 states and 2670 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:18:53,557 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:18:55,725 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-04 14:18:57,823 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-04 14:18:59,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:19:02,013 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-04 14:19:04,111 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-04 14:19:06,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:19:08,301 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-04 14:19:10,417 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-04 14:19:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:19:41,071 INFO L93 Difference]: Finished difference Result 17530 states and 21337 transitions. [2021-11-04 14:19:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-04 14:19:41,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-04 14:19:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:19:41,093 INFO L225 Difference]: With dead ends: 17530 [2021-11-04 14:19:41,093 INFO L226 Difference]: Without dead ends: 16532 [2021-11-04 14:19:41,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 737.91ms TimeCoverageRelationStatistics Valid=673, Invalid=1979, Unknown=0, NotChecked=0, Total=2652 [2021-11-04 14:19:41,099 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9527 mSDsluCounter, 20834 mSDsCounter, 0 mSdLazyCounter, 27319 mSolverCounterSat, 126 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40120.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 116.64ms SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 27319 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43672.97ms IncrementalHoareTripleChecker+Time [2021-11-04 14:19:41,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9527 Valid, 0 Invalid, 27453 Unknown, 0 Unchecked, 116.64ms Time], IncrementalHoareTripleChecker [126 Valid, 27319 Invalid, 8 Unknown, 0 Unchecked, 43672.97ms Time] [2021-11-04 14:19:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16532 states. [2021-11-04 14:19:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16532 to 2190. [2021-11-04 14:19:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2168 states have (on average 1.2306273062730628) internal successors, (2668), 2189 states have internal predecessors, (2668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:19:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 2668 transitions. [2021-11-04 14:19:41,672 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 2668 transitions. Word has length 88 [2021-11-04 14:19:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:19:41,672 INFO L470 AbstractCegarLoop]: Abstraction has 2190 states and 2668 transitions. [2021-11-04 14:19:41,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:19:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2668 transitions. [2021-11-04 14:19:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-04 14:19:41,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:19:41,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:19:41,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-04 14:19:41,674 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:19:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:19:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 344891226, now seen corresponding path program 1 times [2021-11-04 14:19:41,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:19:41,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286722006] [2021-11-04 14:19:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:19:41,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:19:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:19:41,810 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-04 14:19:41,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:19:41,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286722006] [2021-11-04 14:19:41,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286722006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:19:41,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:19:41,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:19:41,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987422164] [2021-11-04 14:19:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:19:41,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:19:41,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:19:41,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:19:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:19:41,814 INFO L87 Difference]: Start difference. First operand 2190 states and 2668 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:19:43,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:19:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:19:51,980 INFO L93 Difference]: Finished difference Result 8291 states and 10192 transitions. [2021-11-04 14:19:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:19:51,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-04 14:19:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:19:51,989 INFO L225 Difference]: With dead ends: 8291 [2021-11-04 14:19:51,989 INFO L226 Difference]: Without dead ends: 6732 [2021-11-04 14:19:51,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.36ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:19:51,992 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1910 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 5166 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7358.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.99ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5166 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8136.66ms IncrementalHoareTripleChecker+Time [2021-11-04 14:19:51,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1910 Valid, 0 Invalid, 5171 Unknown, 0 Unchecked, 13.99ms Time], IncrementalHoareTripleChecker [4 Valid, 5166 Invalid, 1 Unknown, 0 Unchecked, 8136.66ms Time] [2021-11-04 14:19:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2021-11-04 14:19:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 2190. [2021-11-04 14:19:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2168 states have (on average 1.2287822878228782) internal successors, (2664), 2189 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:19:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 2664 transitions. [2021-11-04 14:19:52,522 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 2664 transitions. Word has length 94 [2021-11-04 14:19:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:19:52,522 INFO L470 AbstractCegarLoop]: Abstraction has 2190 states and 2664 transitions. [2021-11-04 14:19:52,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:19:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2664 transitions. [2021-11-04 14:19:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-04 14:19:52,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:19:52,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:19:52,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-04 14:19:52,524 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:19:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:19:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1391811087, now seen corresponding path program 1 times [2021-11-04 14:19:52,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:19:52,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311491758] [2021-11-04 14:19:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:19:52,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:19:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:19:52,616 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-04 14:19:52,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:19:52,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311491758] [2021-11-04 14:19:52,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311491758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:19:52,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:19:52,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:19:52,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15443] [2021-11-04 14:19:52,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:19:52,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:19:52,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:19:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:19:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:19:52,617 INFO L87 Difference]: Start difference. First operand 2190 states and 2664 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:19:55,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:19:57,726 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-04 14:19:59,786 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-04 14:20:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:20:07,779 INFO L93 Difference]: Finished difference Result 6628 states and 8043 transitions. [2021-11-04 14:20:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 14:20:07,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-11-04 14:20:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:20:07,786 INFO L225 Difference]: With dead ends: 6628 [2021-11-04 14:20:07,786 INFO L226 Difference]: Without dead ends: 5069 [2021-11-04 14:20:07,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.46ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 14:20:07,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1685 mSDsluCounter, 4236 mSDsCounter, 0 mSdLazyCounter, 6360 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12360.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.02ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6360 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13370.30ms IncrementalHoareTripleChecker+Time [2021-11-04 14:20:07,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1685 Valid, 0 Invalid, 6366 Unknown, 0 Unchecked, 22.02ms Time], IncrementalHoareTripleChecker [3 Valid, 6360 Invalid, 3 Unknown, 0 Unchecked, 13370.30ms Time] [2021-11-04 14:20:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2021-11-04 14:20:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 2086. [2021-11-04 14:20:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2065 states have (on average 1.2198547215496367) internal successors, (2519), 2085 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2519 transitions. [2021-11-04 14:20:08,301 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2519 transitions. Word has length 97 [2021-11-04 14:20:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:20:08,301 INFO L470 AbstractCegarLoop]: Abstraction has 2086 states and 2519 transitions. [2021-11-04 14:20:08,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2519 transitions. [2021-11-04 14:20:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-04 14:20:08,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:20:08,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:20:08,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-04 14:20:08,302 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:20:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:20:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1278786296, now seen corresponding path program 1 times [2021-11-04 14:20:08,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:20:08,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588678227] [2021-11-04 14:20:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:20:08,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:20:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:20:08,636 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-04 14:20:08,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:20:08,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588678227] [2021-11-04 14:20:08,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588678227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:20:08,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:20:08,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-04 14:20:08,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297068757] [2021-11-04 14:20:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:20:08,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-04 14:20:08,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:20:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-04 14:20:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-11-04 14:20:08,638 INFO L87 Difference]: Start difference. First operand 2086 states and 2519 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:10,664 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:20:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:20:23,189 INFO L93 Difference]: Finished difference Result 3579 states and 4350 transitions. [2021-11-04 14:20:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-04 14:20:23,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-04 14:20:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:20:23,192 INFO L225 Difference]: With dead ends: 3579 [2021-11-04 14:20:23,192 INFO L226 Difference]: Without dead ends: 2083 [2021-11-04 14:20:23,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 295.26ms TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-11-04 14:20:23,195 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 13051 mSDsCounter, 0 mSdLazyCounter, 14321 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12402.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.03ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13563.22ms IncrementalHoareTripleChecker+Time [2021-11-04 14:20:23,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 14334 Unknown, 0 Unchecked, 31.03ms Time], IncrementalHoareTripleChecker [12 Valid, 14321 Invalid, 1 Unknown, 0 Unchecked, 13563.22ms Time] [2021-11-04 14:20:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2021-11-04 14:20:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083. [2021-11-04 14:20:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2062 states have (on average 1.2196896217264792) internal successors, (2515), 2082 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2515 transitions. [2021-11-04 14:20:23,698 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2515 transitions. Word has length 98 [2021-11-04 14:20:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:20:23,698 INFO L470 AbstractCegarLoop]: Abstraction has 2083 states and 2515 transitions. [2021-11-04 14:20:23,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2515 transitions. [2021-11-04 14:20:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-04 14:20:23,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:20:23,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:20:23,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-04 14:20:23,700 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:20:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:20:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1307286586, now seen corresponding path program 1 times [2021-11-04 14:20:23,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:20:23,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829377595] [2021-11-04 14:20:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:20:23,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:20:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:20:23,924 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-04 14:20:23,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:20:23,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829377595] [2021-11-04 14:20:23,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829377595] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:20:23,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:20:23,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:20:23,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285280506] [2021-11-04 14:20:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:20:23,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:20:23,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:20:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:20:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:20:23,926 INFO L87 Difference]: Start difference. First operand 2083 states and 2515 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:25,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:20:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:20:29,342 INFO L93 Difference]: Finished difference Result 3574 states and 4344 transitions. [2021-11-04 14:20:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 14:20:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-11-04 14:20:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:20:29,345 INFO L225 Difference]: With dead ends: 3574 [2021-11-04 14:20:29,345 INFO L226 Difference]: Without dead ends: 2081 [2021-11-04 14:20:29,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.75ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-04 14:20:29,347 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2026 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4290.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4691.08ms IncrementalHoareTripleChecker+Time [2021-11-04 14:20:29,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2026 Valid, 0 Invalid, 2045 Unknown, 0 Unchecked, 13.29ms Time], IncrementalHoareTripleChecker [0 Valid, 2044 Invalid, 1 Unknown, 0 Unchecked, 4691.08ms Time] [2021-11-04 14:20:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2021-11-04 14:20:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2081. [2021-11-04 14:20:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2060 states have (on average 1.2194174757281553) internal successors, (2512), 2080 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2512 transitions. [2021-11-04 14:20:29,861 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2512 transitions. Word has length 98 [2021-11-04 14:20:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:20:29,861 INFO L470 AbstractCegarLoop]: Abstraction has 2081 states and 2512 transitions. [2021-11-04 14:20:29,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2512 transitions. [2021-11-04 14:20:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-04 14:20:29,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:20:29,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 14:20:29,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-04 14:20:29,862 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:20:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:20:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1602023763, now seen corresponding path program 1 times [2021-11-04 14:20:29,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:20:29,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216795822] [2021-11-04 14:20:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:20:29,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:20:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:20:30,378 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-04 14:20:30,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:20:30,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216795822] [2021-11-04 14:20:30,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216795822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:20:30,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:20:30,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-04 14:20:30,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273790792] [2021-11-04 14:20:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:20:30,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-04 14:20:30,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:20:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-04 14:20:30,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-04 14:20:30,380 INFO L87 Difference]: Start difference. First operand 2081 states and 2512 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:20:32,047 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:20:34,145 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-04 14:20:36,260 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-04 14:20:38,351 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:20:40,467 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-04 14:20:42,558 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:20:44,662 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-04 14:20:46,801 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-04 14:20:48,917 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-04 14:20:51,043 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-04 14:20:53,144 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-04 14:21:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:21:02,796 INFO L93 Difference]: Finished difference Result 5444 states and 6595 transitions. [2021-11-04 14:21:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-04 14:21:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2021-11-04 14:21:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:21:02,800 INFO L225 Difference]: With dead ends: 5444 [2021-11-04 14:21:02,800 INFO L226 Difference]: Without dead ends: 3740 [2021-11-04 14:21:02,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 224.19ms TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-11-04 14:21:02,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5006 mSDsluCounter, 9830 mSDsCounter, 0 mSdLazyCounter, 11051 mSolverCounterSat, 10 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28892.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.94ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11051 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30939.60ms IncrementalHoareTripleChecker+Time [2021-11-04 14:21:02,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5006 Valid, 0 Invalid, 11071 Unknown, 0 Unchecked, 24.94ms Time], IncrementalHoareTripleChecker [10 Valid, 11051 Invalid, 10 Unknown, 0 Unchecked, 30939.60ms Time] [2021-11-04 14:21:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2021-11-04 14:21:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 2154. [2021-11-04 14:21:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2133 states have (on average 1.2184716361931551) internal successors, (2599), 2153 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2599 transitions. [2021-11-04 14:21:03,351 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2599 transitions. Word has length 108 [2021-11-04 14:21:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:21:03,351 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2599 transitions. [2021-11-04 14:21:03,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2599 transitions. [2021-11-04 14:21:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-04 14:21:03,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:21:03,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:21:03,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-04 14:21:03,352 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:21:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:21:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1620569360, now seen corresponding path program 1 times [2021-11-04 14:21:03,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:21:03,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387848304] [2021-11-04 14:21:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:21:03,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:21:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:21:03,472 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-04 14:21:03,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:21:03,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387848304] [2021-11-04 14:21:03,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387848304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:21:03,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:21:03,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:21:03,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037120950] [2021-11-04 14:21:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:21:03,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:21:03,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:21:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:21:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:21:03,474 INFO L87 Difference]: Start difference. First operand 2154 states and 2599 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:05,495 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:21:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:21:09,900 INFO L93 Difference]: Finished difference Result 5247 states and 6316 transitions. [2021-11-04 14:21:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:21:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2021-11-04 14:21:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:21:09,903 INFO L225 Difference]: With dead ends: 5247 [2021-11-04 14:21:09,903 INFO L226 Difference]: Without dead ends: 3179 [2021-11-04 14:21:09,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.05ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:21:09,905 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 430 mSDsluCounter, 2272 mSDsCounter, 0 mSdLazyCounter, 3906 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4851.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.15ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5367.03ms IncrementalHoareTripleChecker+Time [2021-11-04 14:21:09,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 0 Invalid, 3909 Unknown, 0 Unchecked, 7.15ms Time], IncrementalHoareTripleChecker [2 Valid, 3906 Invalid, 1 Unknown, 0 Unchecked, 5367.03ms Time] [2021-11-04 14:21:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2021-11-04 14:21:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2163. [2021-11-04 14:21:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2142 states have (on average 1.2189542483660132) internal successors, (2611), 2162 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2611 transitions. [2021-11-04 14:21:10,458 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2611 transitions. Word has length 130 [2021-11-04 14:21:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:21:10,458 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 2611 transitions. [2021-11-04 14:21:10,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2611 transitions. [2021-11-04 14:21:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-04 14:21:10,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:21:10,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:21:10,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-04 14:21:10,459 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:21:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:21:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1202895358, now seen corresponding path program 1 times [2021-11-04 14:21:10,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:21:10,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227693897] [2021-11-04 14:21:10,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:21:10,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:21:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:21:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-04 14:21:10,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:21:10,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227693897] [2021-11-04 14:21:10,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227693897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:21:10,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:21:10,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:21:10,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306209653] [2021-11-04 14:21:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:21:10,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 14:21:10,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:21:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 14:21:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 14:21:10,603 INFO L87 Difference]: Start difference. First operand 2163 states and 2611 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:12,624 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:21:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:21:17,924 INFO L93 Difference]: Finished difference Result 5265 states and 6340 transitions. [2021-11-04 14:21:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 14:21:17,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-11-04 14:21:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:21:17,927 INFO L225 Difference]: With dead ends: 5265 [2021-11-04 14:21:17,927 INFO L226 Difference]: Without dead ends: 3198 [2021-11-04 14:21:17,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.07ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:21:17,929 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 425 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 3906 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5568.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.68ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6148.63ms IncrementalHoareTripleChecker+Time [2021-11-04 14:21:17,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 0 Invalid, 3908 Unknown, 0 Unchecked, 11.68ms Time], IncrementalHoareTripleChecker [1 Valid, 3906 Invalid, 1 Unknown, 0 Unchecked, 6148.63ms Time] [2021-11-04 14:21:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2021-11-04 14:21:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 2181. [2021-11-04 14:21:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2160 states have (on average 1.2203703703703703) internal successors, (2636), 2180 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2636 transitions. [2021-11-04 14:21:18,487 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2636 transitions. Word has length 138 [2021-11-04 14:21:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:21:18,488 INFO L470 AbstractCegarLoop]: Abstraction has 2181 states and 2636 transitions. [2021-11-04 14:21:18,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2636 transitions. [2021-11-04 14:21:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-04 14:21:18,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:21:18,489 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:21:18,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-04 14:21:18,489 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:21:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:21:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash -768865846, now seen corresponding path program 1 times [2021-11-04 14:21:18,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:21:18,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804974587] [2021-11-04 14:21:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:21:18,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:21:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:21:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:21:18,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:21:18,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804974587] [2021-11-04 14:21:18,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804974587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:21:18,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:21:18,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 14:21:18,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285670098] [2021-11-04 14:21:18,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:21:18,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 14:21:18,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:21:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 14:21:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:21:18,644 INFO L87 Difference]: Start difference. First operand 2181 states and 2636 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:20,664 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:21:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:21:29,483 INFO L93 Difference]: Finished difference Result 9779 states and 11876 transitions. [2021-11-04 14:21:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:21:29,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 146 [2021-11-04 14:21:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:21:29,493 INFO L225 Difference]: With dead ends: 9779 [2021-11-04 14:21:29,493 INFO L226 Difference]: Without dead ends: 7730 [2021-11-04 14:21:29,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.65ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:21:29,498 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4881 mSDsluCounter, 4290 mSDsCounter, 0 mSdLazyCounter, 5410 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7573.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4881 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.45ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8352.19ms IncrementalHoareTripleChecker+Time [2021-11-04 14:21:29,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4881 Valid, 0 Invalid, 5429 Unknown, 0 Unchecked, 22.45ms Time], IncrementalHoareTripleChecker [18 Valid, 5410 Invalid, 1 Unknown, 0 Unchecked, 8352.19ms Time] [2021-11-04 14:21:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2021-11-04 14:21:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 2185. [2021-11-04 14:21:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2164 states have (on average 1.21996303142329) internal successors, (2640), 2184 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2640 transitions. [2021-11-04 14:21:30,090 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2640 transitions. Word has length 146 [2021-11-04 14:21:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:21:30,090 INFO L470 AbstractCegarLoop]: Abstraction has 2185 states and 2640 transitions. [2021-11-04 14:21:30,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2640 transitions. [2021-11-04 14:21:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-04 14:21:30,091 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:21:30,091 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:21:30,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-04 14:21:30,092 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:21:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:21:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -437037487, now seen corresponding path program 1 times [2021-11-04 14:21:30,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:21:30,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072040386] [2021-11-04 14:21:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:21:30,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:21:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:21:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:21:30,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:21:30,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072040386] [2021-11-04 14:21:30,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072040386] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:21:30,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:21:30,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 14:21:30,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987162773] [2021-11-04 14:21:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:21:30,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 14:21:30,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:21:30,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 14:21:30,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:21:30,238 INFO L87 Difference]: Start difference. First operand 2185 states and 2640 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:32,263 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:21:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:21:40,524 INFO L93 Difference]: Finished difference Result 9658 states and 11730 transitions. [2021-11-04 14:21:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:21:40,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 151 [2021-11-04 14:21:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:21:40,533 INFO L225 Difference]: With dead ends: 9658 [2021-11-04 14:21:40,533 INFO L226 Difference]: Without dead ends: 7639 [2021-11-04 14:21:40,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.43ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:21:40,537 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4731 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 5563 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7007.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.19ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5563 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7826.46ms IncrementalHoareTripleChecker+Time [2021-11-04 14:21:40,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4731 Valid, 0 Invalid, 5581 Unknown, 0 Unchecked, 19.19ms Time], IncrementalHoareTripleChecker [17 Valid, 5563 Invalid, 1 Unknown, 0 Unchecked, 7826.46ms Time] [2021-11-04 14:21:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2021-11-04 14:21:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 2189. [2021-11-04 14:21:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 2168 states have (on average 1.2195571955719557) internal successors, (2644), 2188 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2644 transitions. [2021-11-04 14:21:41,168 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2644 transitions. Word has length 151 [2021-11-04 14:21:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:21:41,168 INFO L470 AbstractCegarLoop]: Abstraction has 2189 states and 2644 transitions. [2021-11-04 14:21:41,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:21:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2644 transitions. [2021-11-04 14:21:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-04 14:21:41,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:21:41,169 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:21:41,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-04 14:21:41,169 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:21:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:21:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash 879075698, now seen corresponding path program 1 times [2021-11-04 14:21:41,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:21:41,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851572529] [2021-11-04 14:21:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:21:41,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:21:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:21:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:21:41,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:21:41,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851572529] [2021-11-04 14:21:41,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851572529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:21:41,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:21:41,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-04 14:21:41,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176785608] [2021-11-04 14:21:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:21:41,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-04 14:21:41,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:21:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-04 14:21:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-04 14:21:41,847 INFO L87 Difference]: Start difference. First operand 2189 states and 2644 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 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-04 14:21:43,872 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:22:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:22:29,644 INFO L93 Difference]: Finished difference Result 24346 states and 29300 transitions. [2021-11-04 14:22:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-04 14:22:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 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) Word has length 156 [2021-11-04 14:22:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:22:29,674 INFO L225 Difference]: With dead ends: 24346 [2021-11-04 14:22:29,674 INFO L226 Difference]: Without dead ends: 23267 [2021-11-04 14:22:29,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 1714.13ms TimeCoverageRelationStatistics Valid=1235, Invalid=5085, Unknown=0, NotChecked=0, Total=6320 [2021-11-04 14:22:29,682 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 25480 mSDsluCounter, 30194 mSDsCounter, 0 mSdLazyCounter, 36940 mSolverCounterSat, 291 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32315.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25480 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 178.38ms SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 36940 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36245.93ms IncrementalHoareTripleChecker+Time [2021-11-04 14:22:29,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25480 Valid, 0 Invalid, 37232 Unknown, 0 Unchecked, 178.38ms Time], IncrementalHoareTripleChecker [291 Valid, 36940 Invalid, 1 Unknown, 0 Unchecked, 36245.93ms Time] [2021-11-04 14:22:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23267 states. [2021-11-04 14:22:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23267 to 2284. [2021-11-04 14:22:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2263 states have (on average 1.216526734423332) internal successors, (2753), 2283 states have internal predecessors, (2753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:22:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 2753 transitions. [2021-11-04 14:22:30,472 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 2753 transitions. Word has length 156 [2021-11-04 14:22:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:22:30,472 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 2753 transitions. [2021-11-04 14:22:30,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 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-04 14:22:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2753 transitions. [2021-11-04 14:22:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-04 14:22:30,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:22:30,473 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:22:30,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-04 14:22:30,473 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:22:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:22:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -699563416, now seen corresponding path program 1 times [2021-11-04 14:22:30,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:22:30,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159097087] [2021-11-04 14:22:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:22:30,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:22:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:22:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:22:31,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:22:31,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159097087] [2021-11-04 14:22:31,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159097087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:22:31,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:22:31,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-04 14:22:31,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32425146] [2021-11-04 14:22:31,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:22:31,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-04 14:22:31,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:22:31,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-04 14:22:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-04 14:22:31,402 INFO L87 Difference]: Start difference. First operand 2284 states and 2753 transitions. Second operand has 16 states, 16 states have (on average 9.3125) internal successors, (149), 16 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:22:33,428 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:23:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:23:25,380 INFO L93 Difference]: Finished difference Result 28545 states and 34232 transitions. [2021-11-04 14:23:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2021-11-04 14:23:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.3125) internal successors, (149), 16 states have internal predecessors, (149), 0 states have call successors, (0), 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 157 [2021-11-04 14:23:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:23:25,421 INFO L225 Difference]: With dead ends: 28545 [2021-11-04 14:23:25,421 INFO L226 Difference]: Without dead ends: 27656 [2021-11-04 14:23:25,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4163 ImplicationChecksByTransitivity, 2744.67ms TimeCoverageRelationStatistics Valid=2070, Invalid=9920, Unknown=0, NotChecked=0, Total=11990 [2021-11-04 14:23:25,430 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31147 mSDsluCounter, 31490 mSDsCounter, 0 mSdLazyCounter, 38459 mSolverCounterSat, 412 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34021.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 183.03ms SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 38459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38200.21ms IncrementalHoareTripleChecker+Time [2021-11-04 14:23:25,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31147 Valid, 0 Invalid, 38872 Unknown, 0 Unchecked, 183.03ms Time], IncrementalHoareTripleChecker [412 Valid, 38459 Invalid, 1 Unknown, 0 Unchecked, 38200.21ms Time] [2021-11-04 14:23:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27656 states. [2021-11-04 14:23:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27656 to 2285. [2021-11-04 14:23:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2264 states have (on average 1.2168727915194346) internal successors, (2755), 2284 states have internal predecessors, (2755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:23:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2755 transitions. [2021-11-04 14:23:26,322 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2755 transitions. Word has length 157 [2021-11-04 14:23:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:23:26,322 INFO L470 AbstractCegarLoop]: Abstraction has 2285 states and 2755 transitions. [2021-11-04 14:23:26,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.3125) internal successors, (149), 16 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:23:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2755 transitions. [2021-11-04 14:23:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-04 14:23:26,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:23:26,323 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:23:26,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-04 14:23:26,323 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:23:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:23:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 706235273, now seen corresponding path program 1 times [2021-11-04 14:23:26,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:23:26,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483959404] [2021-11-04 14:23:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:23:26,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:23:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:23:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:23:27,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:23:27,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483959404] [2021-11-04 14:23:27,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483959404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:23:27,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:23:27,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 14:23:27,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454083762] [2021-11-04 14:23:27,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:23:27,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 14:23:27,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:23:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 14:23:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:23:27,014 INFO L87 Difference]: Start difference. First operand 2285 states and 2755 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-04 14:23:29,040 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:23:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:23:41,039 INFO L93 Difference]: Finished difference Result 7347 states and 8884 transitions. [2021-11-04 14:23:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 14:23:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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) Word has length 161 [2021-11-04 14:23:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:23:41,045 INFO L225 Difference]: With dead ends: 7347 [2021-11-04 14:23:41,046 INFO L226 Difference]: Without dead ends: 5362 [2021-11-04 14:23:41,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 108.34ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:23:41,050 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3809 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 7505 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10143.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3809 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.51ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11320.46ms IncrementalHoareTripleChecker+Time [2021-11-04 14:23:41,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3809 Valid, 0 Invalid, 7526 Unknown, 0 Unchecked, 22.51ms Time], IncrementalHoareTripleChecker [20 Valid, 7505 Invalid, 1 Unknown, 0 Unchecked, 11320.46ms Time] [2021-11-04 14:23:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2021-11-04 14:23:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 2208. [2021-11-04 14:23:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2187 states have (on average 1.2158207590306356) internal successors, (2659), 2207 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:23:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2659 transitions. [2021-11-04 14:23:41,909 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2659 transitions. Word has length 161 [2021-11-04 14:23:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:23:41,909 INFO L470 AbstractCegarLoop]: Abstraction has 2208 states and 2659 transitions. [2021-11-04 14:23:41,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 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-04 14:23:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2659 transitions. [2021-11-04 14:23:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-04 14:23:41,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:23:41,910 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:23:41,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-04 14:23:41,910 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:23:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:23:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 572221767, now seen corresponding path program 1 times [2021-11-04 14:23:41,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:23:41,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342691149] [2021-11-04 14:23:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:23:41,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:23:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:23:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:23:42,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:23:42,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342691149] [2021-11-04 14:23:42,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342691149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:23:42,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:23:42,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 14:23:42,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670629386] [2021-11-04 14:23:42,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:23:42,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:23:42,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:23:42,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:23:42,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:23:42,062 INFO L87 Difference]: Start difference. First operand 2208 states and 2659 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 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-04 14:23:44,090 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:23:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:23:52,551 INFO L93 Difference]: Finished difference Result 3234 states and 3855 transitions. [2021-11-04 14:23:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:23:52,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 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) Word has length 161 [2021-11-04 14:23:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:23:52,556 INFO L225 Difference]: With dead ends: 3234 [2021-11-04 14:23:52,556 INFO L226 Difference]: Without dead ends: 3222 [2021-11-04 14:23:52,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.84ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-04 14:23:52,560 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2394 mSDsluCounter, 5025 mSDsCounter, 0 mSdLazyCounter, 7662 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7897.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.37ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7662 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8834.58ms IncrementalHoareTripleChecker+Time [2021-11-04 14:23:52,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2394 Valid, 0 Invalid, 7695 Unknown, 0 Unchecked, 15.37ms Time], IncrementalHoareTripleChecker [32 Valid, 7662 Invalid, 1 Unknown, 0 Unchecked, 8834.58ms Time] [2021-11-04 14:23:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2021-11-04 14:23:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3049. [2021-11-04 14:23:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 3028 states have (on average 1.2199471598414795) internal successors, (3694), 3048 states have internal predecessors, (3694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:23:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 3694 transitions. [2021-11-04 14:23:53,709 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 3694 transitions. Word has length 161 [2021-11-04 14:23:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:23:53,709 INFO L470 AbstractCegarLoop]: Abstraction has 3049 states and 3694 transitions. [2021-11-04 14:23:53,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 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-04 14:23:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 3694 transitions. [2021-11-04 14:23:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-04 14:23:53,710 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:23:53,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:23:53,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-04 14:23:53,711 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:23:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:23:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -515114779, now seen corresponding path program 1 times [2021-11-04 14:23:53,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:23:53,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584039590] [2021-11-04 14:23:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:23:53,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:23:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:23:54,269 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-04 14:23:54,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:23:54,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584039590] [2021-11-04 14:23:54,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584039590] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:23:54,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:23:54,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-04 14:23:54,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080250264] [2021-11-04 14:23:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:23:54,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 14:23:54,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:23:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 14:23:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:23:54,270 INFO L87 Difference]: Start difference. First operand 3049 states and 3694 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:23:56,294 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:24:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:24:07,253 INFO L93 Difference]: Finished difference Result 5928 states and 7181 transitions. [2021-11-04 14:24:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-04 14:24:07,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2021-11-04 14:24:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:24:07,257 INFO L225 Difference]: With dead ends: 5928 [2021-11-04 14:24:07,257 INFO L226 Difference]: Without dead ends: 3778 [2021-11-04 14:24:07,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 198.03ms TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-04 14:24:07,260 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 735 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 10024 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10014.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.53ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 10024 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11004.97ms IncrementalHoareTripleChecker+Time [2021-11-04 14:24:07,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 0 Invalid, 10041 Unknown, 0 Unchecked, 22.53ms Time], IncrementalHoareTripleChecker [16 Valid, 10024 Invalid, 1 Unknown, 0 Unchecked, 11004.97ms Time] [2021-11-04 14:24:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2021-11-04 14:24:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3073. [2021-11-04 14:24:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 3052 states have (on average 1.2172346002621233) internal successors, (3715), 3072 states have internal predecessors, (3715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3715 transitions. [2021-11-04 14:24:08,399 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3715 transitions. Word has length 170 [2021-11-04 14:24:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:24:08,399 INFO L470 AbstractCegarLoop]: Abstraction has 3073 states and 3715 transitions. [2021-11-04 14:24:08,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3715 transitions. [2021-11-04 14:24:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-04 14:24:08,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:24:08,400 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:24:08,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-04 14:24:08,400 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:24:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:24:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -713989717, now seen corresponding path program 1 times [2021-11-04 14:24:08,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:24:08,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941677607] [2021-11-04 14:24:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:24:08,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:24:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:24:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:24:08,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:24:08,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941677607] [2021-11-04 14:24:08,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941677607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:24:08,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:24:08,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:24:08,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032040271] [2021-11-04 14:24:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:24:08,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 14:24:08,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:24:08,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 14:24:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 14:24:08,498 INFO L87 Difference]: Start difference. First operand 3073 states and 3715 transitions. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:10,521 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:24:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:24:15,346 INFO L93 Difference]: Finished difference Result 6876 states and 8286 transitions. [2021-11-04 14:24:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:24:15,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2021-11-04 14:24:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:24:15,353 INFO L225 Difference]: With dead ends: 6876 [2021-11-04 14:24:15,353 INFO L226 Difference]: Without dead ends: 4708 [2021-11-04 14:24:15,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.81ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 14:24:15,357 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2518 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 3148 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4250.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.95ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4662.32ms IncrementalHoareTripleChecker+Time [2021-11-04 14:24:15,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2518 Valid, 0 Invalid, 3152 Unknown, 0 Unchecked, 5.95ms Time], IncrementalHoareTripleChecker [3 Valid, 3148 Invalid, 1 Unknown, 0 Unchecked, 4662.32ms Time] [2021-11-04 14:24:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2021-11-04 14:24:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 3073. [2021-11-04 14:24:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 3052 states have (on average 1.2162516382699868) internal successors, (3712), 3072 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3712 transitions. [2021-11-04 14:24:16,539 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3712 transitions. Word has length 184 [2021-11-04 14:24:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:24:16,539 INFO L470 AbstractCegarLoop]: Abstraction has 3073 states and 3712 transitions. [2021-11-04 14:24:16,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3712 transitions. [2021-11-04 14:24:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-04 14:24:16,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:24:16,540 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:24:16,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-04 14:24:16,540 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:24:16,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:24:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1940185695, now seen corresponding path program 1 times [2021-11-04 14:24:16,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:24:16,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875295210] [2021-11-04 14:24:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:24:16,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:24:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:24:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:24:16,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:24:16,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875295210] [2021-11-04 14:24:16,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875295210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:24:16,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:24:16,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-04 14:24:16,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742639109] [2021-11-04 14:24:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:24:16,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 14:24:16,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:24:16,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 14:24:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-04 14:24:16,720 INFO L87 Difference]: Start difference. First operand 3073 states and 3712 transitions. Second operand has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:18,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:24:20,458 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-04 14:24:22,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:24:24,657 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-04 14:24:26,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:24:28,869 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-04 14:24:30,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:24:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:24:43,122 INFO L93 Difference]: Finished difference Result 9730 states and 11675 transitions. [2021-11-04 14:24:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-04 14:24:43,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2021-11-04 14:24:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:24:43,129 INFO L225 Difference]: With dead ends: 9730 [2021-11-04 14:24:43,129 INFO L226 Difference]: Without dead ends: 6927 [2021-11-04 14:24:43,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 117.78ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-04 14:24:43,133 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4800 mSDsluCounter, 9466 mSDsCounter, 0 mSdLazyCounter, 11501 mSolverCounterSat, 13 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21431.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.04ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11501 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23168.10ms IncrementalHoareTripleChecker+Time [2021-11-04 14:24:43,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4800 Valid, 0 Invalid, 11519 Unknown, 0 Unchecked, 23.04ms Time], IncrementalHoareTripleChecker [13 Valid, 11501 Invalid, 5 Unknown, 0 Unchecked, 23168.10ms Time] [2021-11-04 14:24:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2021-11-04 14:24:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 2888. [2021-11-04 14:24:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2868 states have (on average 1.2158298465829847) internal successors, (3487), 2887 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3487 transitions. [2021-11-04 14:24:44,295 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3487 transitions. Word has length 188 [2021-11-04 14:24:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:24:44,295 INFO L470 AbstractCegarLoop]: Abstraction has 2888 states and 3487 transitions. [2021-11-04 14:24:44,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3487 transitions. [2021-11-04 14:24:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-04 14:24:44,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:24:44,296 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:24:44,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-04 14:24:44,297 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:24:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:24:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash -483804853, now seen corresponding path program 1 times [2021-11-04 14:24:44,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:24:44,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014333570] [2021-11-04 14:24:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:24:44,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:24:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:24:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:24:44,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:24:44,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014333570] [2021-11-04 14:24:44,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014333570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:24:44,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:24:44,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 14:24:44,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54424194] [2021-11-04 14:24:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:24:44,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 14:24:44,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:24:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 14:24:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:24:44,455 INFO L87 Difference]: Start difference. First operand 2888 states and 3487 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:46,515 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-04 14:24:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:24:54,658 INFO L93 Difference]: Finished difference Result 7961 states and 9535 transitions. [2021-11-04 14:24:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 14:24:54,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2021-11-04 14:24:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:24:54,688 INFO L225 Difference]: With dead ends: 7961 [2021-11-04 14:24:54,689 INFO L226 Difference]: Without dead ends: 6074 [2021-11-04 14:24:54,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.17ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:24:54,692 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2018 mSDsluCounter, 4560 mSDsCounter, 0 mSdLazyCounter, 5813 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6650.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.03ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5813 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7329.09ms IncrementalHoareTripleChecker+Time [2021-11-04 14:24:54,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2018 Valid, 0 Invalid, 5830 Unknown, 0 Unchecked, 14.03ms Time], IncrementalHoareTripleChecker [16 Valid, 5813 Invalid, 1 Unknown, 0 Unchecked, 7329.09ms Time] [2021-11-04 14:24:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2021-11-04 14:24:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 2892. [2021-11-04 14:24:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2872 states have (on average 1.2155292479108635) internal successors, (3491), 2891 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 3491 transitions. [2021-11-04 14:24:55,836 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 3491 transitions. Word has length 195 [2021-11-04 14:24:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:24:55,836 INFO L470 AbstractCegarLoop]: Abstraction has 2892 states and 3491 transitions. [2021-11-04 14:24:55,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3491 transitions. [2021-11-04 14:24:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-04 14:24:55,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:24:55,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:24:55,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-04 14:24:55,838 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:24:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:24:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1271543827, now seen corresponding path program 1 times [2021-11-04 14:24:55,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:24:55,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362055414] [2021-11-04 14:24:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:24:55,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:24:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:24:56,285 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-04 14:24:56,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:24:56,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362055414] [2021-11-04 14:24:56,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362055414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:24:56,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:24:56,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-04 14:24:56,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114754808] [2021-11-04 14:24:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:24:56,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 14:24:56,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:24:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 14:24:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:24:56,286 INFO L87 Difference]: Start difference. First operand 2892 states and 3491 transitions. Second operand has 10 states, 10 states have (on average 19.5) internal successors, (195), 10 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:24:58,310 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:25:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:25:08,435 INFO L93 Difference]: Finished difference Result 5822 states and 7017 transitions. [2021-11-04 14:25:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-04 14:25:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.5) internal successors, (195), 10 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2021-11-04 14:25:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:25:08,440 INFO L225 Difference]: With dead ends: 5822 [2021-11-04 14:25:08,440 INFO L226 Difference]: Without dead ends: 3651 [2021-11-04 14:25:08,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 172.66ms TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-04 14:25:08,442 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 747 mSDsluCounter, 8619 mSDsCounter, 0 mSdLazyCounter, 10014 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9192.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.94ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 10014 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10142.48ms IncrementalHoareTripleChecker+Time [2021-11-04 14:25:08,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 0 Invalid, 10033 Unknown, 0 Unchecked, 20.94ms Time], IncrementalHoareTripleChecker [18 Valid, 10014 Invalid, 1 Unknown, 0 Unchecked, 10142.48ms Time] [2021-11-04 14:25:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2021-11-04 14:25:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2901. [2021-11-04 14:25:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2881 states have (on average 1.2148559527941687) internal successors, (3500), 2900 states have internal predecessors, (3500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:25:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3500 transitions. [2021-11-04 14:25:09,624 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3500 transitions. Word has length 195 [2021-11-04 14:25:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:25:09,624 INFO L470 AbstractCegarLoop]: Abstraction has 2901 states and 3500 transitions. [2021-11-04 14:25:09,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.5) internal successors, (195), 10 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:25:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3500 transitions. [2021-11-04 14:25:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-11-04 14:25:09,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:25:09,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:25:09,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-04 14:25:09,626 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:25:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:25:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash -912140456, now seen corresponding path program 1 times [2021-11-04 14:25:09,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:25:09,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033515579] [2021-11-04 14:25:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:25:09,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:25:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:25:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 14:25:10,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:25:10,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033515579] [2021-11-04 14:25:10,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033515579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:25:10,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:25:10,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-04 14:25:10,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383083105] [2021-11-04 14:25:10,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:25:10,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 14:25:10,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:25:10,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 14:25:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-04 14:25:10,083 INFO L87 Difference]: Start difference. First operand 2901 states and 3500 transitions. Second operand has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:25:12,106 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:25:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:25:23,055 INFO L93 Difference]: Finished difference Result 5858 states and 7053 transitions. [2021-11-04 14:25:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-04 14:25:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2021-11-04 14:25:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:25:23,060 INFO L225 Difference]: With dead ends: 5858 [2021-11-04 14:25:23,060 INFO L226 Difference]: Without dead ends: 3678 [2021-11-04 14:25:23,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 177.52ms TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2021-11-04 14:25:23,062 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 747 mSDsluCounter, 8605 mSDsCounter, 0 mSdLazyCounter, 9996 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9893.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.40ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 9996 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10897.76ms IncrementalHoareTripleChecker+Time [2021-11-04 14:25:23,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 0 Invalid, 10017 Unknown, 0 Unchecked, 21.40ms Time], IncrementalHoareTripleChecker [20 Valid, 9996 Invalid, 1 Unknown, 0 Unchecked, 10897.76ms Time] [2021-11-04 14:25:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2021-11-04 14:25:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 2901. [2021-11-04 14:25:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2881 states have (on average 1.2148559527941687) internal successors, (3500), 2900 states have internal predecessors, (3500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:25:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3500 transitions. [2021-11-04 14:25:24,259 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3500 transitions. Word has length 198 [2021-11-04 14:25:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:25:24,259 INFO L470 AbstractCegarLoop]: Abstraction has 2901 states and 3500 transitions. [2021-11-04 14:25:24,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:25:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3500 transitions. [2021-11-04 14:25:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-04 14:25:24,260 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:25:24,261 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:25:24,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-04 14:25:24,261 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:25:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:25:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1640610854, now seen corresponding path program 1 times [2021-11-04 14:25:24,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:25:24,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262621089] [2021-11-04 14:25:24,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:25:24,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:25:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:25:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:25:25,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:25:25,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262621089] [2021-11-04 14:25:25,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262621089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:25:25,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:25:25,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-04 14:25:25,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418721929] [2021-11-04 14:25:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:25:25,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-04 14:25:25,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:25:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-04 14:25:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-04 14:25:25,164 INFO L87 Difference]: Start difference. First operand 2901 states and 3500 transitions. Second operand has 15 states, 15 states have (on average 12.8) internal successors, (192), 15 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:25:27,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:26:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:26:04,258 INFO L93 Difference]: Finished difference Result 13804 states and 16370 transitions. [2021-11-04 14:26:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-04 14:26:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.8) internal successors, (192), 15 states have internal predecessors, (192), 0 states have call successors, (0), 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 200 [2021-11-04 14:26:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:26:04,275 INFO L225 Difference]: With dead ends: 13804 [2021-11-04 14:26:04,275 INFO L226 Difference]: Without dead ends: 12913 [2021-11-04 14:26:04,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 1424.57ms TimeCoverageRelationStatistics Valid=1025, Invalid=4087, Unknown=0, NotChecked=0, Total=5112 [2021-11-04 14:26:04,280 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13229 mSDsluCounter, 22669 mSDsCounter, 0 mSdLazyCounter, 28696 mSolverCounterSat, 132 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27047.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 139.81ms SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 28696 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30117.31ms IncrementalHoareTripleChecker+Time [2021-11-04 14:26:04,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13229 Valid, 0 Invalid, 28829 Unknown, 0 Unchecked, 139.81ms Time], IncrementalHoareTripleChecker [132 Valid, 28696 Invalid, 1 Unknown, 0 Unchecked, 30117.31ms Time] [2021-11-04 14:26:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12913 states. [2021-11-04 14:26:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12913 to 2917. [2021-11-04 14:26:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2897 states have (on average 1.2143596824301002) internal successors, (3518), 2916 states have internal predecessors, (3518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:26:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 3518 transitions. [2021-11-04 14:26:05,597 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 3518 transitions. Word has length 200 [2021-11-04 14:26:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:26:05,597 INFO L470 AbstractCegarLoop]: Abstraction has 2917 states and 3518 transitions. [2021-11-04 14:26:05,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.8) internal successors, (192), 15 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:26:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3518 transitions. [2021-11-04 14:26:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-11-04 14:26:05,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:26:05,598 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:26:05,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-04 14:26:05,598 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:26:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:26:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1441146240, now seen corresponding path program 1 times [2021-11-04 14:26:05,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:26:05,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036557014] [2021-11-04 14:26:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:26:05,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:26:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:26:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:26:06,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:26:06,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036557014] [2021-11-04 14:26:06,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036557014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:26:06,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:26:06,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-04 14:26:06,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79676997] [2021-11-04 14:26:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:26:06,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-04 14:26:06,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:26:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-04 14:26:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-04 14:26:06,364 INFO L87 Difference]: Start difference. First operand 2917 states and 3518 transitions. Second operand has 16 states, 16 states have (on average 12.0625) internal successors, (193), 16 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-04 14:26:08,390 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:26:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:26:52,270 INFO L93 Difference]: Finished difference Result 14831 states and 17434 transitions. [2021-11-04 14:26:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-11-04 14:26:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.0625) internal successors, (193), 16 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2021-11-04 14:26:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:26:52,292 INFO L225 Difference]: With dead ends: 14831 [2021-11-04 14:26:52,292 INFO L226 Difference]: Without dead ends: 13940 [2021-11-04 14:26:52,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 2143.17ms TimeCoverageRelationStatistics Valid=1465, Invalid=6367, Unknown=0, NotChecked=0, Total=7832 [2021-11-04 14:26:52,298 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 17267 mSDsluCounter, 24879 mSDsCounter, 0 mSdLazyCounter, 31448 mSolverCounterSat, 154 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31540.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 175.62ms SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 31448 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35043.97ms IncrementalHoareTripleChecker+Time [2021-11-04 14:26:52,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17267 Valid, 0 Invalid, 31603 Unknown, 0 Unchecked, 175.62ms Time], IncrementalHoareTripleChecker [154 Valid, 31448 Invalid, 1 Unknown, 0 Unchecked, 35043.97ms Time] [2021-11-04 14:26:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13940 states. [2021-11-04 14:26:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13940 to 2914. [2021-11-04 14:26:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2894 states have (on average 1.2142363510711818) internal successors, (3514), 2913 states have internal predecessors, (3514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:26:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3514 transitions. [2021-11-04 14:26:53,658 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3514 transitions. Word has length 201 [2021-11-04 14:26:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:26:53,658 INFO L470 AbstractCegarLoop]: Abstraction has 2914 states and 3514 transitions. [2021-11-04 14:26:53,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.0625) internal successors, (193), 16 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-04 14:26:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3514 transitions. [2021-11-04 14:26:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-11-04 14:26:53,660 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:26:53,660 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:26:53,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-04 14:26:53,660 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:26:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:26:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 509244801, now seen corresponding path program 1 times [2021-11-04 14:26:53,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:26:53,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252536088] [2021-11-04 14:26:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:26:53,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:26:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:26:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:26:53,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:26:53,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252536088] [2021-11-04 14:26:53,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252536088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:26:53,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:26:53,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 14:26:53,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442904445] [2021-11-04 14:26:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:26:53,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 14:26:53,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:26:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 14:26:53,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-04 14:26:53,858 INFO L87 Difference]: Start difference. First operand 2914 states and 3514 transitions. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:26:55,882 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:27:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 14:27:11,136 INFO L93 Difference]: Finished difference Result 5039 states and 5976 transitions. [2021-11-04 14:27:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 14:27:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 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 205 [2021-11-04 14:27:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 14:27:11,141 INFO L225 Difference]: With dead ends: 5039 [2021-11-04 14:27:11,142 INFO L226 Difference]: Without dead ends: 5029 [2021-11-04 14:27:11,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 24.27ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-04 14:27:11,142 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3025 mSDsluCounter, 8715 mSDsCounter, 0 mSdLazyCounter, 12819 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12735.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3025 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 28.73ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 12819 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14187.76ms IncrementalHoareTripleChecker+Time [2021-11-04 14:27:11,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3025 Valid, 0 Invalid, 12851 Unknown, 0 Unchecked, 28.73ms Time], IncrementalHoareTripleChecker [31 Valid, 12819 Invalid, 1 Unknown, 0 Unchecked, 14187.76ms Time] [2021-11-04 14:27:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2021-11-04 14:27:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 3790. [2021-11-04 14:27:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3770 states have (on average 1.2177718832891247) internal successors, (4591), 3789 states have internal predecessors, (4591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:27:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4591 transitions. [2021-11-04 14:27:12,868 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 4591 transitions. Word has length 205 [2021-11-04 14:27:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 14:27:12,868 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 4591 transitions. [2021-11-04 14:27:12,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:27:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4591 transitions. [2021-11-04 14:27:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-04 14:27:12,870 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 14:27:12,870 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 14:27:12,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-04 14:27:12,870 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 92 more)] === [2021-11-04 14:27:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 14:27:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1527921954, now seen corresponding path program 1 times [2021-11-04 14:27:12,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 14:27:12,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569913010] [2021-11-04 14:27:12,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 14:27:12,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 14:27:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 14:27:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 14:27:13,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 14:27:13,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569913010] [2021-11-04 14:27:13,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569913010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 14:27:13,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 14:27:13,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-04 14:27:13,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340598497] [2021-11-04 14:27:13,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 14:27:13,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 14:27:13,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 14:27:13,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 14:27:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-04 14:27:13,060 INFO L87 Difference]: Start difference. First operand 3790 states and 4591 transitions. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 14:27:15,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15