./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--net--ethernet--8390--pcnet_cs.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--net--ethernet--8390--pcnet_cs.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 274050ce25e73de8cc1ed86f63ba21850687938f96f1d000f839b96904fb551e --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 13:46:28,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 13:46:28,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 13:46:28,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 13:46:28,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 13:46:28,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 13:46:28,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 13:46:28,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 13:46:28,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 13:46:28,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 13:46:28,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 13:46:28,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 13:46:28,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 13:46:28,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 13:46:28,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 13:46:28,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 13:46:28,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 13:46:28,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 13:46:28,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 13:46:28,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 13:46:28,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 13:46:28,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 13:46:28,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 13:46:28,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 13:46:28,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 13:46:28,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 13:46:28,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 13:46:28,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 13:46:28,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 13:46:28,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 13:46:28,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 13:46:28,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 13:46:28,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 13:46:28,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 13:46:28,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 13:46:28,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 13:46:28,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 13:46:28,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 13:46:28,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 13:46:28,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 13:46:28,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 13:46:28,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 13:46:28,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 13:46:28,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 13:46:28,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 13:46:28,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 13:46:28,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 13:46:28,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 13:46:28,772 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 13:46:28,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 13:46:28,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 13:46:28,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 13:46:28,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 13:46:28,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 13:46:28,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 13:46:28,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 13:46:28,774 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 13:46:28,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 13:46:28,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 13:46:28,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 13:46:28,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 13:46:28,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:46:28,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 13:46:28,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 13:46:28,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 13:46:28,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 13:46:28,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 13:46:28,776 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 13:46:28,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 13:46:28,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 13:46:28,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 13:46:28,776 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 -> 274050ce25e73de8cc1ed86f63ba21850687938f96f1d000f839b96904fb551e [2021-11-04 13:46:29,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 13:46:29,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 13:46:29,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 13:46:29,034 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 13:46:29,035 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 13:46:29,036 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--net--ethernet--8390--pcnet_cs.ko.cil.i [2021-11-04 13:46:29,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581a4a5ce/06db953d3e6c4ef9873ba484db3c321e/FLAG5aedec529 [2021-11-04 13:46:29,753 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 13:46:29,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i [2021-11-04 13:46:29,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581a4a5ce/06db953d3e6c4ef9873ba484db3c321e/FLAG5aedec529 [2021-11-04 13:46:30,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581a4a5ce/06db953d3e6c4ef9873ba484db3c321e [2021-11-04 13:46:30,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 13:46:30,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 13:46:30,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 13:46:30,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 13:46:30,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 13:46:30,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:46:30" (1/1) ... [2021-11-04 13:46:30,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9b9c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:30, skipping insertion in model container [2021-11-04 13:46:30,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 01:46:30" (1/1) ... [2021-11-04 13:46:30,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 13:46:30,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 13:46:33,187 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434383,434396] [2021-11-04 13:46:33,189 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434528,434541] [2021-11-04 13:46:33,189 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434674,434687] [2021-11-04 13:46:33,190 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434839,434852] [2021-11-04 13:46:33,190 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434997,435010] [2021-11-04 13:46:33,191 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435155,435168] [2021-11-04 13:46:33,191 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435313,435326] [2021-11-04 13:46:33,192 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435473,435486] [2021-11-04 13:46:33,192 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435632,435645] [2021-11-04 13:46:33,192 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435771,435784] [2021-11-04 13:46:33,192 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435913,435926] [2021-11-04 13:46:33,193 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436062,436075] [2021-11-04 13:46:33,193 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436201,436214] [2021-11-04 13:46:33,194 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436356,436369] [2021-11-04 13:46:33,194 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436516,436529] [2021-11-04 13:46:33,195 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436667,436680] [2021-11-04 13:46:33,195 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436818,436831] [2021-11-04 13:46:33,195 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436970,436983] [2021-11-04 13:46:33,196 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437119,437132] [2021-11-04 13:46:33,196 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437267,437280] [2021-11-04 13:46:33,197 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437424,437437] [2021-11-04 13:46:33,197 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437573,437586] [2021-11-04 13:46:33,197 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437729,437742] [2021-11-04 13:46:33,197 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437882,437895] [2021-11-04 13:46:33,198 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438028,438041] [2021-11-04 13:46:33,199 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438171,438184] [2021-11-04 13:46:33,199 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438323,438336] [2021-11-04 13:46:33,200 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438469,438482] [2021-11-04 13:46:33,200 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438614,438627] [2021-11-04 13:46:33,200 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438768,438781] [2021-11-04 13:46:33,201 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438919,438932] [2021-11-04 13:46:33,202 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439074,439087] [2021-11-04 13:46:33,202 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439226,439239] [2021-11-04 13:46:33,203 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439381,439394] [2021-11-04 13:46:33,203 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439545,439558] [2021-11-04 13:46:33,203 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439701,439714] [2021-11-04 13:46:33,205 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439865,439878] [2021-11-04 13:46:33,205 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440007,440020] [2021-11-04 13:46:33,205 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440165,440178] [2021-11-04 13:46:33,205 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440332,440345] [2021-11-04 13:46:33,206 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440491,440504] [2021-11-04 13:46:33,206 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440650,440663] [2021-11-04 13:46:33,206 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440799,440812] [2021-11-04 13:46:33,207 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440946,440959] [2021-11-04 13:46:33,207 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441085,441098] [2021-11-04 13:46:33,207 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441248,441261] [2021-11-04 13:46:33,208 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441414,441427] [2021-11-04 13:46:33,208 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441578,441591] [2021-11-04 13:46:33,209 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441743,441756] [2021-11-04 13:46:33,209 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441908,441921] [2021-11-04 13:46:33,210 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442074,442087] [2021-11-04 13:46:33,210 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442239,442252] [2021-11-04 13:46:33,210 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442406,442419] [2021-11-04 13:46:33,210 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442566,442579] [2021-11-04 13:46:33,211 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442728,442741] [2021-11-04 13:46:33,211 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442887,442900] [2021-11-04 13:46:33,211 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443033,443046] [2021-11-04 13:46:33,211 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443176,443189] [2021-11-04 13:46:33,212 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443320,443333] [2021-11-04 13:46:33,212 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443463,443476] [2021-11-04 13:46:33,212 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443607,443620] [2021-11-04 13:46:33,213 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443748,443761] [2021-11-04 13:46:33,213 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443886,443899] [2021-11-04 13:46:33,213 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444044,444057] [2021-11-04 13:46:33,214 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444203,444216] [2021-11-04 13:46:33,214 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444359,444372] [2021-11-04 13:46:33,214 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444508,444521] [2021-11-04 13:46:33,215 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444660,444673] [2021-11-04 13:46:33,215 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444811,444824] [2021-11-04 13:46:33,215 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444960,444973] [2021-11-04 13:46:33,215 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445112,445125] [2021-11-04 13:46:33,216 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445260,445273] [2021-11-04 13:46:33,216 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445413,445426] [2021-11-04 13:46:33,216 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445564,445577] [2021-11-04 13:46:33,216 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445714,445727] [2021-11-04 13:46:33,217 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445861,445874] [2021-11-04 13:46:33,217 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446012,446025] [2021-11-04 13:46:33,217 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446163,446176] [2021-11-04 13:46:33,218 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446311,446324] [2021-11-04 13:46:33,218 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446477,446490] [2021-11-04 13:46:33,218 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446646,446659] [2021-11-04 13:46:33,219 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446813,446826] [2021-11-04 13:46:33,219 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446981,446994] [2021-11-04 13:46:33,219 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447131,447144] [2021-11-04 13:46:33,219 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447278,447291] [2021-11-04 13:46:33,220 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447439,447452] [2021-11-04 13:46:33,220 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447609,447622] [2021-11-04 13:46:33,220 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447771,447784] [2021-11-04 13:46:33,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:46:33,345 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 13:46:33,596 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434383,434396] [2021-11-04 13:46:33,597 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434528,434541] [2021-11-04 13:46:33,597 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434674,434687] [2021-11-04 13:46:33,598 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434839,434852] [2021-11-04 13:46:33,599 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--net--ethernet--8390--pcnet_cs.ko.cil.i[434997,435010] [2021-11-04 13:46:33,601 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435155,435168] [2021-11-04 13:46:33,602 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435313,435326] [2021-11-04 13:46:33,602 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435473,435486] [2021-11-04 13:46:33,602 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435632,435645] [2021-11-04 13:46:33,603 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435771,435784] [2021-11-04 13:46:33,603 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--net--ethernet--8390--pcnet_cs.ko.cil.i[435913,435926] [2021-11-04 13:46:33,604 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436062,436075] [2021-11-04 13:46:33,604 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436201,436214] [2021-11-04 13:46:33,604 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436356,436369] [2021-11-04 13:46:33,604 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436516,436529] [2021-11-04 13:46:33,605 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436667,436680] [2021-11-04 13:46:33,605 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436818,436831] [2021-11-04 13:46:33,605 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--net--ethernet--8390--pcnet_cs.ko.cil.i[436970,436983] [2021-11-04 13:46:33,605 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437119,437132] [2021-11-04 13:46:33,606 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437267,437280] [2021-11-04 13:46:33,606 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437424,437437] [2021-11-04 13:46:33,606 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437573,437586] [2021-11-04 13:46:33,607 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437729,437742] [2021-11-04 13:46:33,607 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--net--ethernet--8390--pcnet_cs.ko.cil.i[437882,437895] [2021-11-04 13:46:33,607 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438028,438041] [2021-11-04 13:46:33,607 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438171,438184] [2021-11-04 13:46:33,608 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438323,438336] [2021-11-04 13:46:33,608 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438469,438482] [2021-11-04 13:46:33,608 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438614,438627] [2021-11-04 13:46:33,609 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438768,438781] [2021-11-04 13:46:33,609 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--net--ethernet--8390--pcnet_cs.ko.cil.i[438919,438932] [2021-11-04 13:46:33,609 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439074,439087] [2021-11-04 13:46:33,609 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439226,439239] [2021-11-04 13:46:33,610 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439381,439394] [2021-11-04 13:46:33,610 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439545,439558] [2021-11-04 13:46:33,610 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439701,439714] [2021-11-04 13:46:33,611 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--net--ethernet--8390--pcnet_cs.ko.cil.i[439865,439878] [2021-11-04 13:46:33,611 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440007,440020] [2021-11-04 13:46:33,612 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440165,440178] [2021-11-04 13:46:33,612 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440332,440345] [2021-11-04 13:46:33,613 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440491,440504] [2021-11-04 13:46:33,613 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440650,440663] [2021-11-04 13:46:33,613 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440799,440812] [2021-11-04 13:46:33,614 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--net--ethernet--8390--pcnet_cs.ko.cil.i[440946,440959] [2021-11-04 13:46:33,614 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441085,441098] [2021-11-04 13:46:33,614 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441248,441261] [2021-11-04 13:46:33,614 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441414,441427] [2021-11-04 13:46:33,615 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441578,441591] [2021-11-04 13:46:33,615 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441743,441756] [2021-11-04 13:46:33,615 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--net--ethernet--8390--pcnet_cs.ko.cil.i[441908,441921] [2021-11-04 13:46:33,616 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442074,442087] [2021-11-04 13:46:33,616 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442239,442252] [2021-11-04 13:46:33,616 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442406,442419] [2021-11-04 13:46:33,616 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442566,442579] [2021-11-04 13:46:33,617 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442728,442741] [2021-11-04 13:46:33,617 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--net--ethernet--8390--pcnet_cs.ko.cil.i[442887,442900] [2021-11-04 13:46:33,617 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443033,443046] [2021-11-04 13:46:33,617 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443176,443189] [2021-11-04 13:46:33,617 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443320,443333] [2021-11-04 13:46:33,618 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443463,443476] [2021-11-04 13:46:33,618 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443607,443620] [2021-11-04 13:46:33,618 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443748,443761] [2021-11-04 13:46:33,619 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--net--ethernet--8390--pcnet_cs.ko.cil.i[443886,443899] [2021-11-04 13:46:33,620 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444044,444057] [2021-11-04 13:46:33,620 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444203,444216] [2021-11-04 13:46:33,622 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444359,444372] [2021-11-04 13:46:33,622 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444508,444521] [2021-11-04 13:46:33,623 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444660,444673] [2021-11-04 13:46:33,626 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444811,444824] [2021-11-04 13:46:33,627 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--net--ethernet--8390--pcnet_cs.ko.cil.i[444960,444973] [2021-11-04 13:46:33,628 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445112,445125] [2021-11-04 13:46:33,628 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445260,445273] [2021-11-04 13:46:33,628 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445413,445426] [2021-11-04 13:46:33,629 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445564,445577] [2021-11-04 13:46:33,632 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445714,445727] [2021-11-04 13:46:33,633 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--net--ethernet--8390--pcnet_cs.ko.cil.i[445861,445874] [2021-11-04 13:46:33,633 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446012,446025] [2021-11-04 13:46:33,633 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446163,446176] [2021-11-04 13:46:33,634 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446311,446324] [2021-11-04 13:46:33,634 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446477,446490] [2021-11-04 13:46:33,635 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446646,446659] [2021-11-04 13:46:33,635 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446813,446826] [2021-11-04 13:46:33,635 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--net--ethernet--8390--pcnet_cs.ko.cil.i[446981,446994] [2021-11-04 13:46:33,636 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447131,447144] [2021-11-04 13:46:33,636 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447278,447291] [2021-11-04 13:46:33,636 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447439,447452] [2021-11-04 13:46:33,636 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447609,447622] [2021-11-04 13:46:33,637 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--net--ethernet--8390--pcnet_cs.ko.cil.i[447771,447784] [2021-11-04 13:46:33,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 13:46:33,863 INFO L208 MainTranslator]: Completed translation [2021-11-04 13:46:33,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33 WrapperNode [2021-11-04 13:46:33,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 13:46:33,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 13:46:33,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 13:46:33,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 13:46:33,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 13:46:34,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 13:46:34,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 13:46:34,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 13:46:34,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:34,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:35,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:35,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 13:46:35,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 13:46:35,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 13:46:35,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 13:46:35,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (1/1) ... [2021-11-04 13:46:35,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 13:46:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 13:46:35,107 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 13:46:35,120 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 13:46:35,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 13:46:35,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 13:46:35,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 13:46:35,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 13:46:35,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 13:47:32,875 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_13_returnLabel: main_#res := 0; [2021-11-04 13:47:32,876 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-04 13:47:32,876 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L10250: #t~ret1290 := main_#res; [2021-11-04 13:47:32,891 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 13:47:32,892 INFO L299 CfgBuilder]: Removed 1996 assume(true) statements. [2021-11-04 13:47:32,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:47:32 BoogieIcfgContainer [2021-11-04 13:47:32,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 13:47:32,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 13:47:32,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 13:47:32,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 13:47:32,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 01:46:30" (1/3) ... [2021-11-04 13:47:32,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7b4776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:47:32, skipping insertion in model container [2021-11-04 13:47:32,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 01:46:33" (2/3) ... [2021-11-04 13:47:32,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7b4776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 01:47:32, skipping insertion in model container [2021-11-04 13:47:32,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 01:47:32" (3/3) ... [2021-11-04 13:47:32,902 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--8390--pcnet_cs.ko.cil.i [2021-11-04 13:47:32,905 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 13:47:32,906 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2021-11-04 13:47:32,954 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 13:47:32,958 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 13:47:32,959 INFO L340 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2021-11-04 13:47:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 1703 states, 1656 states have (on average 1.3079710144927537) internal successors, (2166), 1702 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states 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 13:47:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-04 13:47:32,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:47:32,986 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] [2021-11-04 13:47:32,986 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:47:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:47:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash 105553669, now seen corresponding path program 1 times [2021-11-04 13:47:32,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:47:32,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681895736] [2021-11-04 13:47:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:47:33,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:47:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:47:35,249 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 13:47:35,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:47:35,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681895736] [2021-11-04 13:47:35,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681895736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:47:35,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:47:35,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:47:35,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677004928] [2021-11-04 13:47:35,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:47:35,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:47:35,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:47:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:47:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:47:35,302 INFO L87 Difference]: Start difference. First operand has 1703 states, 1656 states have (on average 1.3079710144927537) internal successors, (2166), 1702 states have internal predecessors, (2166), 0 states have call successors, (0), 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 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 13:47:37,786 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:47:45,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:47:48,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:48:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:48:20,902 INFO L93 Difference]: Finished difference Result 4685 states and 5960 transitions. [2021-11-04 13:48:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:48:20,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-04 13:48:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:48:20,939 INFO L225 Difference]: With dead ends: 4685 [2021-11-04 13:48:20,939 INFO L226 Difference]: Without dead ends: 2925 [2021-11-04 13:48:20,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:48:20,947 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1956 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 6542 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41567.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1956 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 88.41ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6542 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44737.14ms IncrementalHoareTripleChecker+Time [2021-11-04 13:48:20,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1956 Valid, 135 Invalid, 6549 Unknown, 0 Unchecked, 88.41ms Time], IncrementalHoareTripleChecker [4 Valid, 6542 Invalid, 3 Unknown, 0 Unchecked, 44737.14ms Time] [2021-11-04 13:48:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-11-04 13:48:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2689. [2021-11-04 13:48:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2642 states have (on average 1.2547312641937927) internal successors, (3315), 2688 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states 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 13:48:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3315 transitions. [2021-11-04 13:48:21,069 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3315 transitions. Word has length 26 [2021-11-04 13:48:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:48:21,070 INFO L470 AbstractCegarLoop]: Abstraction has 2689 states and 3315 transitions. [2021-11-04 13:48:21,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 13:48:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3315 transitions. [2021-11-04 13:48:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 13:48:21,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:48:21,072 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] [2021-11-04 13:48:21,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 13:48:21,072 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:48:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:48:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1641868823, now seen corresponding path program 1 times [2021-11-04 13:48:21,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:48:21,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250551420] [2021-11-04 13:48:21,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:48:21,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:48:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:48:22,599 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 13:48:22,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:48:22,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250551420] [2021-11-04 13:48:22,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250551420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:48:22,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:48:22,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:48:22,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492035189] [2021-11-04 13:48:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:48:22,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:48:22,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:48:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:48:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:48:22,602 INFO L87 Difference]: Start difference. First operand 2689 states and 3315 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 13:48:24,967 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:48:31,755 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:48:35,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:49:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:49:07,265 INFO L93 Difference]: Finished difference Result 3975 states and 4873 transitions. [2021-11-04 13:49:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:49:07,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-11-04 13:49:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:49:07,278 INFO L225 Difference]: With dead ends: 3975 [2021-11-04 13:49:07,278 INFO L226 Difference]: Without dead ends: 3971 [2021-11-04 13:49:07,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 97.60ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:49:07,280 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1856 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 5882 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41528.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 55.41ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5882 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44092.37ms IncrementalHoareTripleChecker+Time [2021-11-04 13:49:07,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1856 Valid, 0 Invalid, 5889 Unknown, 0 Unchecked, 55.41ms Time], IncrementalHoareTripleChecker [4 Valid, 5882 Invalid, 3 Unknown, 0 Unchecked, 44092.37ms Time] [2021-11-04 13:49:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2021-11-04 13:49:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3805. [2021-11-04 13:49:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3805 states, 3758 states have (on average 1.2538584353379456) internal successors, (4712), 3804 states have internal predecessors, (4712), 0 states have call successors, (0), 0 states 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 13:49:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 4712 transitions. [2021-11-04 13:49:07,353 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 4712 transitions. Word has length 28 [2021-11-04 13:49:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:49:07,354 INFO L470 AbstractCegarLoop]: Abstraction has 3805 states and 4712 transitions. [2021-11-04 13:49:07,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 13:49:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 4712 transitions. [2021-11-04 13:49:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-04 13:49:07,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:49:07,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:49:07,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 13:49:07,356 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:49:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:49:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1582670547, now seen corresponding path program 1 times [2021-11-04 13:49:07,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:49:07,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120044976] [2021-11-04 13:49:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:49:07,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:49:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:49:08,856 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 13:49:08,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:49:08,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120044976] [2021-11-04 13:49:08,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120044976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:49:08,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:49:08,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:49:08,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420848460] [2021-11-04 13:49:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:49:08,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:49:08,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:49:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:49:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:49:08,857 INFO L87 Difference]: Start difference. First operand 3805 states and 4712 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:49:11,176 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:49:18,259 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:49:22,007 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:49:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:49:56,673 INFO L93 Difference]: Finished difference Result 3971 states and 4869 transitions. [2021-11-04 13:49:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:49:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-04 13:49:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:49:56,684 INFO L225 Difference]: With dead ends: 3971 [2021-11-04 13:49:56,684 INFO L226 Difference]: Without dead ends: 3967 [2021-11-04 13:49:56,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 117.25ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:49:56,687 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1834 mSDsluCounter, 3864 mSDsCounter, 0 mSdLazyCounter, 5890 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44611.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.33ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5890 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47341.66ms IncrementalHoareTripleChecker+Time [2021-11-04 13:49:56,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1834 Valid, 0 Invalid, 5897 Unknown, 0 Unchecked, 40.33ms Time], IncrementalHoareTripleChecker [4 Valid, 5890 Invalid, 3 Unknown, 0 Unchecked, 47341.66ms Time] [2021-11-04 13:49:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-04 13:49:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3809. [2021-11-04 13:49:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3762 states have (on average 1.2535885167464116) internal successors, (4716), 3808 states have internal predecessors, (4716), 0 states have call successors, (0), 0 states 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 13:49:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 4716 transitions. [2021-11-04 13:49:56,766 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 4716 transitions. Word has length 30 [2021-11-04 13:49:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:49:56,766 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 4716 transitions. [2021-11-04 13:49:56,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:49:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 4716 transitions. [2021-11-04 13:49:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 13:49:56,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:49:56,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:49:56,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 13:49:56,771 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:49:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:49:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash -527701807, now seen corresponding path program 1 times [2021-11-04 13:49:56,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:49:56,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124795627] [2021-11-04 13:49:56,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:49:56,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:49:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:49:58,145 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 13:49:58,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:49:58,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124795627] [2021-11-04 13:49:58,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124795627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:49:58,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:49:58,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:49:58,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493853846] [2021-11-04 13:49:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:49:58,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:49:58,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:49:58,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:49:58,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:49:58,146 INFO L87 Difference]: Start difference. First operand 3809 states and 4716 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:50:00,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:07,834 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:11,617 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:50:47,219 INFO L93 Difference]: Finished difference Result 3967 states and 4865 transitions. [2021-11-04 13:50:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:50:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-04 13:50:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:50:47,230 INFO L225 Difference]: With dead ends: 3967 [2021-11-04 13:50:47,230 INFO L226 Difference]: Without dead ends: 3963 [2021-11-04 13:50:47,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 120.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:50:47,232 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1812 mSDsluCounter, 3872 mSDsCounter, 0 mSdLazyCounter, 5898 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45782.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.54ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5898 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48597.60ms IncrementalHoareTripleChecker+Time [2021-11-04 13:50:47,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1812 Valid, 0 Invalid, 5905 Unknown, 0 Unchecked, 40.54ms Time], IncrementalHoareTripleChecker [4 Valid, 5898 Invalid, 3 Unknown, 0 Unchecked, 48597.60ms Time] [2021-11-04 13:50:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2021-11-04 13:50:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3813. [2021-11-04 13:50:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3813 states, 3766 states have (on average 1.253319171534785) internal successors, (4720), 3812 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states 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 13:50:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 4720 transitions. [2021-11-04 13:50:47,305 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 4720 transitions. Word has length 32 [2021-11-04 13:50:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:50:47,306 INFO L470 AbstractCegarLoop]: Abstraction has 3813 states and 4720 transitions. [2021-11-04 13:50:47,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:50:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 4720 transitions. [2021-11-04 13:50:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 13:50:47,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:50:47,308 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] [2021-11-04 13:50:47,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 13:50:47,308 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:50:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:50:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash -315024171, now seen corresponding path program 1 times [2021-11-04 13:50:47,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:50:47,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198507532] [2021-11-04 13:50:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:50:47,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:50:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:50:48,804 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 13:50:48,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:50:48,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198507532] [2021-11-04 13:50:48,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198507532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:50:48,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:50:48,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:50:48,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864369944] [2021-11-04 13:50:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:50:48,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:50:48,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:50:48,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:50:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:50:48,805 INFO L87 Difference]: Start difference. First operand 3813 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 13:50:51,126 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:50:58,407 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:51:02,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:51:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:51:37,776 INFO L93 Difference]: Finished difference Result 3963 states and 4861 transitions. [2021-11-04 13:51:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:51:37,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-11-04 13:51:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:51:37,789 INFO L225 Difference]: With dead ends: 3963 [2021-11-04 13:51:37,790 INFO L226 Difference]: Without dead ends: 3959 [2021-11-04 13:51:37,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:51:37,792 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1790 mSDsluCounter, 3880 mSDsCounter, 0 mSdLazyCounter, 5906 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45503.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.09ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5906 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48497.71ms IncrementalHoareTripleChecker+Time [2021-11-04 13:51:37,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1790 Valid, 0 Invalid, 5913 Unknown, 0 Unchecked, 39.09ms Time], IncrementalHoareTripleChecker [4 Valid, 5906 Invalid, 3 Unknown, 0 Unchecked, 48497.71ms Time] [2021-11-04 13:51:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2021-11-04 13:51:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 3817. [2021-11-04 13:51:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3817 states, 3770 states have (on average 1.2530503978779841) internal successors, (4724), 3816 states have internal predecessors, (4724), 0 states have call successors, (0), 0 states 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 13:51:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4724 transitions. [2021-11-04 13:51:37,859 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4724 transitions. Word has length 34 [2021-11-04 13:51:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:51:37,860 INFO L470 AbstractCegarLoop]: Abstraction has 3817 states and 4724 transitions. [2021-11-04 13:51:37,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 13:51:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4724 transitions. [2021-11-04 13:51:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-04 13:51:37,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:51:37,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:51:37,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 13:51:37,862 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:51:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:51:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2090245831, now seen corresponding path program 1 times [2021-11-04 13:51:37,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:51:37,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123305514] [2021-11-04 13:51:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:51:37,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:51:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:51:39,170 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 13:51:39,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:51:39,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123305514] [2021-11-04 13:51:39,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123305514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:51:39,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:51:39,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:51:39,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414119342] [2021-11-04 13:51:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:51:39,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:51:39,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:51:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:51:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:51:39,172 INFO L87 Difference]: Start difference. First operand 3817 states and 4724 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:51:41,505 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:51:48,983 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:51:52,875 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:52:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:52:30,679 INFO L93 Difference]: Finished difference Result 3959 states and 4857 transitions. [2021-11-04 13:52:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:52:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-04 13:52:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:52:30,689 INFO L225 Difference]: With dead ends: 3959 [2021-11-04 13:52:30,690 INFO L226 Difference]: Without dead ends: 3955 [2021-11-04 13:52:30,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 117.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:52:30,691 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1768 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 5914 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47766.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.16ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5914 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51009.54ms IncrementalHoareTripleChecker+Time [2021-11-04 13:52:30,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1768 Valid, 0 Invalid, 5921 Unknown, 0 Unchecked, 42.16ms Time], IncrementalHoareTripleChecker [4 Valid, 5914 Invalid, 3 Unknown, 0 Unchecked, 51009.54ms Time] [2021-11-04 13:52:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2021-11-04 13:52:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3821. [2021-11-04 13:52:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3774 states have (on average 1.2527821939586645) internal successors, (4728), 3820 states have internal predecessors, (4728), 0 states have call successors, (0), 0 states 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 13:52:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 4728 transitions. [2021-11-04 13:52:30,765 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 4728 transitions. Word has length 36 [2021-11-04 13:52:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:52:30,765 INFO L470 AbstractCegarLoop]: Abstraction has 3821 states and 4728 transitions. [2021-11-04 13:52:30,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:52:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 4728 transitions. [2021-11-04 13:52:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 13:52:30,766 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:52:30,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:52:30,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 13:52:30,766 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:52:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:52:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1318723069, now seen corresponding path program 1 times [2021-11-04 13:52:30,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:52:30,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33465210] [2021-11-04 13:52:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:52:30,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:52:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:52:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:52:32,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:52:32,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33465210] [2021-11-04 13:52:32,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33465210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:52:32,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:52:32,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:52:32,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524234137] [2021-11-04 13:52:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:52:32,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:52:32,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:52:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:52:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:52:32,084 INFO L87 Difference]: Start difference. First operand 3821 states and 4728 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:52:34,536 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:52:41,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:52:45,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:53:24,020 INFO L93 Difference]: Finished difference Result 3955 states and 4853 transitions. [2021-11-04 13:53:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:53:24,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-04 13:53:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:53:24,031 INFO L225 Difference]: With dead ends: 3955 [2021-11-04 13:53:24,031 INFO L226 Difference]: Without dead ends: 3951 [2021-11-04 13:53:24,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.15ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:53:24,032 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1746 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 5922 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48007.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.60ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5922 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51447.28ms IncrementalHoareTripleChecker+Time [2021-11-04 13:53:24,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1746 Valid, 0 Invalid, 5929 Unknown, 0 Unchecked, 39.60ms Time], IncrementalHoareTripleChecker [4 Valid, 5922 Invalid, 3 Unknown, 0 Unchecked, 51447.28ms Time] [2021-11-04 13:53:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2021-11-04 13:53:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3825. [2021-11-04 13:53:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3825 states, 3778 states have (on average 1.2525145579671784) internal successors, (4732), 3824 states have internal predecessors, (4732), 0 states have call successors, (0), 0 states 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 13:53:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 4732 transitions. [2021-11-04 13:53:24,105 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 4732 transitions. Word has length 38 [2021-11-04 13:53:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:53:24,106 INFO L470 AbstractCegarLoop]: Abstraction has 3825 states and 4732 transitions. [2021-11-04 13:53:24,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:53:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 4732 transitions. [2021-11-04 13:53:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-04 13:53:24,106 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:53:24,107 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] [2021-11-04 13:53:24,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 13:53:24,107 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:53:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:53:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 277789473, now seen corresponding path program 1 times [2021-11-04 13:53:24,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:53:24,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836709174] [2021-11-04 13:53:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:53:24,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:53:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:53:25,356 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 13:53:25,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:53:25,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836709174] [2021-11-04 13:53:25,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836709174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:53:25,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:53:25,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:53:25,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90306328] [2021-11-04 13:53:25,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:53:25,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:53:25,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:53:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:53:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:53:25,358 INFO L87 Difference]: Start difference. First operand 3825 states and 4732 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 13:53:27,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:35,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:53:39,398 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:54:18,311 INFO L93 Difference]: Finished difference Result 3951 states and 4849 transitions. [2021-11-04 13:54:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:54:18,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-04 13:54:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:54:18,321 INFO L225 Difference]: With dead ends: 3951 [2021-11-04 13:54:18,321 INFO L226 Difference]: Without dead ends: 3947 [2021-11-04 13:54:18,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 123.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:54:18,323 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1724 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 5930 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48688.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.60ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5930 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52443.20ms IncrementalHoareTripleChecker+Time [2021-11-04 13:54:18,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1724 Valid, 0 Invalid, 5937 Unknown, 0 Unchecked, 41.60ms Time], IncrementalHoareTripleChecker [4 Valid, 5930 Invalid, 3 Unknown, 0 Unchecked, 52443.20ms Time] [2021-11-04 13:54:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2021-11-04 13:54:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3829. [2021-11-04 13:54:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3829 states, 3782 states have (on average 1.2522474881015335) internal successors, (4736), 3828 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states 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 13:54:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 4736 transitions. [2021-11-04 13:54:18,397 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 4736 transitions. Word has length 40 [2021-11-04 13:54:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:54:18,397 INFO L470 AbstractCegarLoop]: Abstraction has 3829 states and 4736 transitions. [2021-11-04 13:54:18,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 13:54:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 4736 transitions. [2021-11-04 13:54:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-04 13:54:18,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:54:18,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:54:18,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 13:54:18,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:54:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:54:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 667983044, now seen corresponding path program 1 times [2021-11-04 13:54:18,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:54:18,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723198368] [2021-11-04 13:54:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:54:18,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:54:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:54:19,783 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 13:54:19,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:54:19,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723198368] [2021-11-04 13:54:19,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723198368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:54:19,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:54:19,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:54:19,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668752184] [2021-11-04 13:54:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:54:19,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:54:19,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:54:19,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:54:19,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:54:19,785 INFO L87 Difference]: Start difference. First operand 3829 states and 4736 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:54:22,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:29,853 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:54:33,784 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:55:12,927 INFO L93 Difference]: Finished difference Result 3947 states and 4845 transitions. [2021-11-04 13:55:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:55:12,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-04 13:55:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:55:12,937 INFO L225 Difference]: With dead ends: 3947 [2021-11-04 13:55:12,937 INFO L226 Difference]: Without dead ends: 3943 [2021-11-04 13:55:12,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 125.93ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:55:12,940 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1702 mSDsluCounter, 3912 mSDsCounter, 0 mSdLazyCounter, 5938 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48776.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.14ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5938 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52653.75ms IncrementalHoareTripleChecker+Time [2021-11-04 13:55:12,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 0 Invalid, 5945 Unknown, 0 Unchecked, 40.14ms Time], IncrementalHoareTripleChecker [4 Valid, 5938 Invalid, 3 Unknown, 0 Unchecked, 52653.75ms Time] [2021-11-04 13:55:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2021-11-04 13:55:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3833. [2021-11-04 13:55:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3786 states have (on average 1.2519809825673534) internal successors, (4740), 3832 states have internal predecessors, (4740), 0 states have call successors, (0), 0 states 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 13:55:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4740 transitions. [2021-11-04 13:55:13,015 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4740 transitions. Word has length 42 [2021-11-04 13:55:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:55:13,015 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 4740 transitions. [2021-11-04 13:55:13,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:55:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4740 transitions. [2021-11-04 13:55:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-04 13:55:13,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:55:13,016 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] [2021-11-04 13:55:13,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 13:55:13,016 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:55:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:55:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1981851336, now seen corresponding path program 1 times [2021-11-04 13:55:13,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:55:13,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451094583] [2021-11-04 13:55:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:55:13,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:55:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:55:14,461 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 13:55:14,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:55:14,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451094583] [2021-11-04 13:55:14,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451094583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:55:14,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:55:14,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:55:14,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327699687] [2021-11-04 13:55:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:55:14,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:55:14,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:55:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:55:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:55:14,464 INFO L87 Difference]: Start difference. First operand 3833 states and 4740 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 13:55:16,797 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:24,555 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:55:28,584 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:56:07,628 INFO L93 Difference]: Finished difference Result 3943 states and 4841 transitions. [2021-11-04 13:56:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:56:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-11-04 13:56:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:56:07,635 INFO L225 Difference]: With dead ends: 3943 [2021-11-04 13:56:07,635 INFO L226 Difference]: Without dead ends: 3939 [2021-11-04 13:56:07,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 126.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:56:07,636 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1680 mSDsluCounter, 3920 mSDsCounter, 0 mSdLazyCounter, 5946 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48663.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 37.89ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5946 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52691.25ms IncrementalHoareTripleChecker+Time [2021-11-04 13:56:07,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1680 Valid, 0 Invalid, 5953 Unknown, 0 Unchecked, 37.89ms Time], IncrementalHoareTripleChecker [4 Valid, 5946 Invalid, 3 Unknown, 0 Unchecked, 52691.25ms Time] [2021-11-04 13:56:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2021-11-04 13:56:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3837. [2021-11-04 13:56:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3790 states have (on average 1.2517150395778365) internal successors, (4744), 3836 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states 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 13:56:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4744 transitions. [2021-11-04 13:56:07,708 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4744 transitions. Word has length 44 [2021-11-04 13:56:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:56:07,708 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 4744 transitions. [2021-11-04 13:56:07,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 13:56:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4744 transitions. [2021-11-04 13:56:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-04 13:56:07,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:56:07,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:56:07,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 13:56:07,709 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:56:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:56:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1888895276, now seen corresponding path program 1 times [2021-11-04 13:56:07,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:56:07,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325414674] [2021-11-04 13:56:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:56:07,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:56:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:56:08,979 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 13:56:08,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:56:08,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325414674] [2021-11-04 13:56:08,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325414674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:56:08,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:56:08,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:56:08,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114863260] [2021-11-04 13:56:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:56:08,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:56:08,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:56:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:56:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:56:08,981 INFO L87 Difference]: Start difference. First operand 3837 states and 4744 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:56:11,329 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:18,910 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:56:22,787 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:57:02,174 INFO L93 Difference]: Finished difference Result 3939 states and 4837 transitions. [2021-11-04 13:57:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:57:02,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-04 13:57:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:57:02,181 INFO L225 Difference]: With dead ends: 3939 [2021-11-04 13:57:02,181 INFO L226 Difference]: Without dead ends: 3935 [2021-11-04 13:57:02,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 122.88ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:57:02,182 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1658 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 5954 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48437.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 41.78ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5954 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52698.21ms IncrementalHoareTripleChecker+Time [2021-11-04 13:57:02,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1658 Valid, 0 Invalid, 5961 Unknown, 0 Unchecked, 41.78ms Time], IncrementalHoareTripleChecker [4 Valid, 5954 Invalid, 3 Unknown, 0 Unchecked, 52698.21ms Time] [2021-11-04 13:57:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2021-11-04 13:57:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3841. [2021-11-04 13:57:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 3794 states have (on average 1.2514496573537164) internal successors, (4748), 3840 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states 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 13:57:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 4748 transitions. [2021-11-04 13:57:02,261 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 4748 transitions. Word has length 46 [2021-11-04 13:57:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:57:02,262 INFO L470 AbstractCegarLoop]: Abstraction has 3841 states and 4748 transitions. [2021-11-04 13:57:02,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 4748 transitions. [2021-11-04 13:57:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-04 13:57:02,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:57:02,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:57:02,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 13:57:02,262 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:57:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:57:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1542532112, now seen corresponding path program 1 times [2021-11-04 13:57:02,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:57:02,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933085135] [2021-11-04 13:57:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:57:02,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:57:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:57:03,523 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 13:57:03,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:57:03,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933085135] [2021-11-04 13:57:03,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933085135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:57:03,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:57:03,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:57:03,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057115442] [2021-11-04 13:57:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:57:03,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:57:03,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:57:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:57:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:57:03,524 INFO L87 Difference]: Start difference. First operand 3841 states and 4748 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:05,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:13,607 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:17,562 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:57:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:57:57,801 INFO L93 Difference]: Finished difference Result 3935 states and 4833 transitions. [2021-11-04 13:57:57,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:57:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-04 13:57:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:57:57,808 INFO L225 Difference]: With dead ends: 3935 [2021-11-04 13:57:57,808 INFO L226 Difference]: Without dead ends: 3931 [2021-11-04 13:57:57,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 122.54ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:57:57,810 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1636 mSDsluCounter, 3936 mSDsCounter, 0 mSdLazyCounter, 5962 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49269.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.89ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5962 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53776.36ms IncrementalHoareTripleChecker+Time [2021-11-04 13:57:57,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1636 Valid, 0 Invalid, 5969 Unknown, 0 Unchecked, 39.89ms Time], IncrementalHoareTripleChecker [4 Valid, 5962 Invalid, 3 Unknown, 0 Unchecked, 53776.36ms Time] [2021-11-04 13:57:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2021-11-04 13:57:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3845. [2021-11-04 13:57:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3798 states have (on average 1.2511848341232228) internal successors, (4752), 3844 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states 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 13:57:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 4752 transitions. [2021-11-04 13:57:57,998 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 4752 transitions. Word has length 48 [2021-11-04 13:57:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:57:57,999 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 4752 transitions. [2021-11-04 13:57:57,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:57:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 4752 transitions. [2021-11-04 13:57:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-04 13:57:57,999 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:57:58,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:57:58,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 13:57:58,000 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:57:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:57:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash -609368300, now seen corresponding path program 1 times [2021-11-04 13:57:58,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:57:58,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113538879] [2021-11-04 13:57:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:57:58,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:57:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:57:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:57:59,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:57:59,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113538879] [2021-11-04 13:57:59,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113538879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:57:59,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:57:59,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:57:59,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318301262] [2021-11-04 13:57:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:57:59,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:57:59,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:57:59,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:57:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:57:59,270 INFO L87 Difference]: Start difference. First operand 3845 states and 4752 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:58:01,606 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:09,574 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:13,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:58:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:58:54,964 INFO L93 Difference]: Finished difference Result 3931 states and 4829 transitions. [2021-11-04 13:58:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:58:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-04 13:58:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:58:54,971 INFO L225 Difference]: With dead ends: 3931 [2021-11-04 13:58:54,971 INFO L226 Difference]: Without dead ends: 3927 [2021-11-04 13:58:54,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 131.57ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:58:54,973 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1614 mSDsluCounter, 3944 mSDsCounter, 0 mSdLazyCounter, 5970 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50446.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.97ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5970 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55176.22ms IncrementalHoareTripleChecker+Time [2021-11-04 13:58:54,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1614 Valid, 0 Invalid, 5977 Unknown, 0 Unchecked, 40.97ms Time], IncrementalHoareTripleChecker [4 Valid, 5970 Invalid, 3 Unknown, 0 Unchecked, 55176.22ms Time] [2021-11-04 13:58:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2021-11-04 13:58:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3849. [2021-11-04 13:58:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3802 states have (on average 1.250920568122041) internal successors, (4756), 3848 states have internal predecessors, (4756), 0 states have call successors, (0), 0 states 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 13:58:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4756 transitions. [2021-11-04 13:58:55,062 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4756 transitions. Word has length 50 [2021-11-04 13:58:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:58:55,063 INFO L470 AbstractCegarLoop]: Abstraction has 3849 states and 4756 transitions. [2021-11-04 13:58:55,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:58:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4756 transitions. [2021-11-04 13:58:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-04 13:58:55,063 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:58:55,064 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] [2021-11-04 13:58:55,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 13:58:55,064 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:58:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:58:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1487109480, now seen corresponding path program 1 times [2021-11-04 13:58:55,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:58:55,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893936128] [2021-11-04 13:58:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:58:55,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:58:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:58:56,335 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 13:58:56,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:58:56,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893936128] [2021-11-04 13:58:56,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893936128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:58:56,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:58:56,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:58:56,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062068126] [2021-11-04 13:58:56,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:58:56,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:58:56,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:58:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:58:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:58:56,336 INFO L87 Difference]: Start difference. First operand 3849 states and 4756 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 13:58:58,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:06,615 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:10,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:59:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:59:52,234 INFO L93 Difference]: Finished difference Result 3927 states and 4825 transitions. [2021-11-04 13:59:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:59:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-11-04 13:59:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:59:52,241 INFO L225 Difference]: With dead ends: 3927 [2021-11-04 13:59:52,241 INFO L226 Difference]: Without dead ends: 3923 [2021-11-04 13:59:52,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 128.48ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:59:52,243 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1592 mSDsluCounter, 3952 mSDsCounter, 0 mSdLazyCounter, 5978 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50283.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 38.36ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5978 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55295.87ms IncrementalHoareTripleChecker+Time [2021-11-04 13:59:52,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1592 Valid, 0 Invalid, 5985 Unknown, 0 Unchecked, 38.36ms Time], IncrementalHoareTripleChecker [4 Valid, 5978 Invalid, 3 Unknown, 0 Unchecked, 55295.87ms Time] [2021-11-04 13:59:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2021-11-04 13:59:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 3853. [2021-11-04 13:59:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3806 states have (on average 1.2506568575932737) internal successors, (4760), 3852 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states 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 13:59:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4760 transitions. [2021-11-04 13:59:52,338 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4760 transitions. Word has length 52 [2021-11-04 13:59:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:59:52,338 INFO L470 AbstractCegarLoop]: Abstraction has 3853 states and 4760 transitions. [2021-11-04 13:59:52,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 13:59:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4760 transitions. [2021-11-04 13:59:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 13:59:52,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:59:52,339 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 13:59:52,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 13:59:52,339 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 44 more)] === [2021-11-04 13:59:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:59:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1112174204, now seen corresponding path program 1 times [2021-11-04 13:59:52,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:59:52,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957769518] [2021-11-04 13:59:52,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:59:52,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:59:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:59:53,625 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 13:59:53,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:59:53,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957769518] [2021-11-04 13:59:53,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957769518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:59:53,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:59:53,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:59:53,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512842705] [2021-11-04 13:59:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:59:53,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:59:53,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:59:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:59:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:59:53,626 INFO L87 Difference]: Start difference. First operand 3853 states and 4760 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 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 13:59:55,968 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:03,809 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 14:00:08,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15