./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--atm--fore_200e.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.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 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-03 03:34:27,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:34:27,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:34:27,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:34:27,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:34:27,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:34:27,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:34:27,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:34:27,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:34:27,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:34:27,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:34:27,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:34:27,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:34:27,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:34:27,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:34:27,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:34:27,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:34:27,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:34:27,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:34:27,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:34:27,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:34:27,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:34:27,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:34:27,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:34:27,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:34:27,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:34:27,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:34:27,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:34:27,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:34:27,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:34:27,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:34:27,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:34:27,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:34:27,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:34:27,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:34:27,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:34:27,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:34:27,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:34:27,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:34:27,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:34:27,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:34:27,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 03:34:27,287 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:34:27,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:34:27,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 03:34:27,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 03:34:27,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:34:27,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:34:27,290 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 03:34:27,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:34:27,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:34:27,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:34:27,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 03:34:27,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:34:27,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 03:34:27,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 03:34:27,291 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:34:27,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 03:34:27,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:34:27,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 03:34:27,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:34:27,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:34:27,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:34:27,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:34:27,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 03:34:27,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 03:34:27,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:34:27,293 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 03:34:27,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 03:34:27,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 03:34:27,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:34:27,295 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 -> 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 [2021-11-03 03:34:27,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:34:27,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:34:27,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:34:27,533 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:34:27,535 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:34:27,536 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--atm--fore_200e.ko.cil.i [2021-11-03 03:34:27,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f08ec14ac/8cccc68c906e4110a47f19058a70b5a0/FLAGd65e12d15 [2021-11-03 03:34:28,277 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:34:28,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2021-11-03 03:34:28,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f08ec14ac/8cccc68c906e4110a47f19058a70b5a0/FLAGd65e12d15 [2021-11-03 03:34:28,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f08ec14ac/8cccc68c906e4110a47f19058a70b5a0 [2021-11-03 03:34:28,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:34:28,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:34:28,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:34:28,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:34:28,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:34:28,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:28" (1/1) ... [2021-11-03 03:34:28,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c0e0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:28, skipping insertion in model container [2021-11-03 03:34:28,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:34:28" (1/1) ... [2021-11-03 03:34:28,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:34:28,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:34:32,034 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2021-11-03 03:34:32,037 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2021-11-03 03:34:32,037 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2021-11-03 03:34:32,038 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2021-11-03 03:34:32,038 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2021-11-03 03:34:32,043 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2021-11-03 03:34:32,043 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2021-11-03 03:34:32,044 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2021-11-03 03:34:32,044 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2021-11-03 03:34:32,045 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2021-11-03 03:34:32,045 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2021-11-03 03:34:32,049 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2021-11-03 03:34:32,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2021-11-03 03:34:32,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2021-11-03 03:34:32,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2021-11-03 03:34:32,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2021-11-03 03:34:32,054 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2021-11-03 03:34:32,055 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2021-11-03 03:34:32,056 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2021-11-03 03:34:32,057 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2021-11-03 03:34:32,057 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2021-11-03 03:34:32,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2021-11-03 03:34:32,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2021-11-03 03:34:32,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2021-11-03 03:34:32,059 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2021-11-03 03:34:32,060 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2021-11-03 03:34:32,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2021-11-03 03:34:32,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2021-11-03 03:34:32,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2021-11-03 03:34:32,063 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2021-11-03 03:34:32,064 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2021-11-03 03:34:32,064 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2021-11-03 03:34:32,065 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2021-11-03 03:34:32,065 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2021-11-03 03:34:32,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2021-11-03 03:34:32,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2021-11-03 03:34:32,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2021-11-03 03:34:32,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2021-11-03 03:34:32,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2021-11-03 03:34:32,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2021-11-03 03:34:32,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2021-11-03 03:34:32,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2021-11-03 03:34:32,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2021-11-03 03:34:32,069 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2021-11-03 03:34:32,069 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2021-11-03 03:34:32,069 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2021-11-03 03:34:32,069 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2021-11-03 03:34:32,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2021-11-03 03:34:32,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2021-11-03 03:34:32,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2021-11-03 03:34:32,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2021-11-03 03:34:32,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2021-11-03 03:34:32,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2021-11-03 03:34:32,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2021-11-03 03:34:32,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2021-11-03 03:34:32,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2021-11-03 03:34:32,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2021-11-03 03:34:32,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2021-11-03 03:34:32,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2021-11-03 03:34:32,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2021-11-03 03:34:32,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2021-11-03 03:34:32,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2021-11-03 03:34:32,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2021-11-03 03:34:32,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2021-11-03 03:34:32,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2021-11-03 03:34:32,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2021-11-03 03:34:32,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2021-11-03 03:34:32,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2021-11-03 03:34:32,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2021-11-03 03:34:32,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2021-11-03 03:34:32,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2021-11-03 03:34:32,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2021-11-03 03:34:32,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2021-11-03 03:34:32,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2021-11-03 03:34:32,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2021-11-03 03:34:32,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2021-11-03 03:34:32,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2021-11-03 03:34:32,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2021-11-03 03:34:32,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2021-11-03 03:34:32,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2021-11-03 03:34:32,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2021-11-03 03:34:32,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2021-11-03 03:34:32,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2021-11-03 03:34:32,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2021-11-03 03:34:32,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2021-11-03 03:34:32,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2021-11-03 03:34:32,083 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2021-11-03 03:34:32,083 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2021-11-03 03:34:32,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:34:32,119 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:34:32,502 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2021-11-03 03:34:32,503 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2021-11-03 03:34:32,503 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2021-11-03 03:34:32,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2021-11-03 03:34:32,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2021-11-03 03:34:32,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2021-11-03 03:34:32,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2021-11-03 03:34:32,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2021-11-03 03:34:32,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2021-11-03 03:34:32,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2021-11-03 03:34:32,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2021-11-03 03:34:32,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2021-11-03 03:34:32,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2021-11-03 03:34:32,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2021-11-03 03:34:32,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2021-11-03 03:34:32,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2021-11-03 03:34:32,507 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2021-11-03 03:34:32,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2021-11-03 03:34:32,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2021-11-03 03:34:32,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2021-11-03 03:34:32,508 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2021-11-03 03:34:32,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2021-11-03 03:34:32,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2021-11-03 03:34:32,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2021-11-03 03:34:32,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2021-11-03 03:34:32,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2021-11-03 03:34:32,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2021-11-03 03:34:32,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2021-11-03 03:34:32,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2021-11-03 03:34:32,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2021-11-03 03:34:32,511 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2021-11-03 03:34:32,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2021-11-03 03:34:32,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2021-11-03 03:34:32,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2021-11-03 03:34:32,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2021-11-03 03:34:32,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2021-11-03 03:34:32,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2021-11-03 03:34:32,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2021-11-03 03:34:32,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2021-11-03 03:34:32,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2021-11-03 03:34:32,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2021-11-03 03:34:32,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2021-11-03 03:34:32,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2021-11-03 03:34:32,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2021-11-03 03:34:32,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2021-11-03 03:34:32,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2021-11-03 03:34:32,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2021-11-03 03:34:32,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2021-11-03 03:34:32,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2021-11-03 03:34:32,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2021-11-03 03:34:32,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2021-11-03 03:34:32,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2021-11-03 03:34:32,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2021-11-03 03:34:32,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2021-11-03 03:34:32,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2021-11-03 03:34:32,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2021-11-03 03:34:32,518 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2021-11-03 03:34:32,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2021-11-03 03:34:32,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2021-11-03 03:34:32,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2021-11-03 03:34:32,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2021-11-03 03:34:32,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2021-11-03 03:34:32,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2021-11-03 03:34:32,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2021-11-03 03:34:32,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2021-11-03 03:34:32,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2021-11-03 03:34:32,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2021-11-03 03:34:32,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2021-11-03 03:34:32,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2021-11-03 03:34:32,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2021-11-03 03:34:32,522 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2021-11-03 03:34:32,523 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2021-11-03 03:34:32,523 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2021-11-03 03:34:32,523 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2021-11-03 03:34:32,523 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2021-11-03 03:34:32,524 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2021-11-03 03:34:32,524 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2021-11-03 03:34:32,524 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2021-11-03 03:34:32,525 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2021-11-03 03:34:32,525 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2021-11-03 03:34:32,525 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2021-11-03 03:34:32,525 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2021-11-03 03:34:32,526 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2021-11-03 03:34:32,526 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2021-11-03 03:34:32,526 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2021-11-03 03:34:32,527 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2021-11-03 03:34:32,527 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2021-11-03 03:34:32,527 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2021-11-03 03:34:32,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:34:32,703 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:34:32,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32 WrapperNode [2021-11-03 03:34:32,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:34:32,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:34:32,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:34:32,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:34:32,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:32,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:34:33,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:34:33,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:34:33,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:34:33,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:34:33,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:34:33,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:34:33,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:34:33,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (1/1) ... [2021-11-03 03:34:33,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:34:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 03:34:33,623 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-03 03:34:33,640 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-03 03:34:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2021-11-03 03:34:33,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2021-11-03 03:34:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2021-11-03 03:34:33,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2021-11-03 03:34:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2021-11-03 03:34:33,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2021-11-03 03:34:33,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2021-11-03 03:34:33,650 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2021-11-03 03:34:33,650 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2021-11-03 03:34:33,650 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2021-11-03 03:34:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 03:34:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 03:34:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-03 03:34:33,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-03 03:34:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2021-11-03 03:34:33,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2021-11-03 03:34:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2021-11-03 03:34:33,651 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2021-11-03 03:34:33,651 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2021-11-03 03:34:33,651 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2021-11-03 03:34:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:34:33,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:34:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-03 03:34:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-03 03:34:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2021-11-03 03:34:33,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2021-11-03 03:34:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2021-11-03 03:34:33,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2021-11-03 03:34:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:34:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 03:34:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 03:34:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2021-11-03 03:34:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2021-11-03 03:34:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2021-11-03 03:34:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2021-11-03 03:34:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 03:34:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-03 03:34:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-03 03:34:33,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 03:34:46,268 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L11887: #t~ret2081 := main_#res; [2021-11-03 03:34:46,269 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_9_returnLabel: main_#res := 0; [2021-11-03 03:34:46,269 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-03 03:34:46,269 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_1_switch_break: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0.offset; [2021-11-03 03:34:46,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:34:46,301 INFO L299 CfgBuilder]: Removed 4286 assume(true) statements. [2021-11-03 03:34:46,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:46 BoogieIcfgContainer [2021-11-03 03:34:46,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:34:46,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:34:46,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:34:46,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:34:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:34:28" (1/3) ... [2021-11-03 03:34:46,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c64afa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:46, skipping insertion in model container [2021-11-03 03:34:46,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:34:32" (2/3) ... [2021-11-03 03:34:46,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c64afa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:34:46, skipping insertion in model container [2021-11-03 03:34:46,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:34:46" (3/3) ... [2021-11-03 03:34:46,315 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2021-11-03 03:34:46,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:34:46,320 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 130 error locations. [2021-11-03 03:34:46,364 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:34:46,370 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-03 03:34:46,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2021-11-03 03:34:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 3741 states, 3572 states have (on average 1.3743001119820828) internal successors, (4909), 3702 states have internal predecessors, (4909), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-03 03:34:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 03:34:46,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:34:46,426 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-03 03:34:46,427 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:34:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:34:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1485327355, now seen corresponding path program 1 times [2021-11-03 03:34:46,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:34:46,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107624972] [2021-11-03 03:34:46,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:34:46,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:34:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:34:46,971 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-03 03:34:46,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:34:46,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107624972] [2021-11-03 03:34:46,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107624972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:34:46,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:34:46,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:34:46,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536780786] [2021-11-03 03:34:46,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:34:46,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:34:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:34:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:34:46,999 INFO L87 Difference]: Start difference. First operand has 3741 states, 3572 states have (on average 1.3743001119820828) internal successors, (4909), 3702 states have internal predecessors, (4909), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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-03 03:34:49,074 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:35:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:35:19,820 INFO L93 Difference]: Finished difference Result 11131 states and 14823 transitions. [2021-11-03 03:35:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:35:19,823 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-03 03:35:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:35:19,857 INFO L225 Difference]: With dead ends: 11131 [2021-11-03 03:35:19,858 INFO L226 Difference]: Without dead ends: 7187 [2021-11-03 03:35:19,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.49ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:35:19,882 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 5049 mSDsluCounter, 9377 mSDsCounter, 0 mSdLazyCounter, 13652 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29174.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5049 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 13657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 87.00ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13652 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31803.60ms IncrementalHoareTripleChecker+Time [2021-11-03 03:35:19,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5049 Valid, 585 Invalid, 13657 Unknown, 0 Unchecked, 87.00ms Time], IncrementalHoareTripleChecker [4 Valid, 13652 Invalid, 1 Unknown, 0 Unchecked, 31803.60ms Time] [2021-11-03 03:35:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2021-11-03 03:35:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 6847. [2021-11-03 03:35:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6847 states, 6639 states have (on average 1.2997439373399609) internal successors, (8629), 6770 states have internal predecessors, (8629), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:35:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6847 states to 6847 states and 8749 transitions. [2021-11-03 03:35:20,122 INFO L78 Accepts]: Start accepts. Automaton has 6847 states and 8749 transitions. Word has length 26 [2021-11-03 03:35:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:35:20,123 INFO L470 AbstractCegarLoop]: Abstraction has 6847 states and 8749 transitions. [2021-11-03 03:35:20,123 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-03 03:35:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6847 states and 8749 transitions. [2021-11-03 03:35:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 03:35:20,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:35:20,126 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-03 03:35:20,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 03:35:20,126 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:35:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:35:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1469993239, now seen corresponding path program 1 times [2021-11-03 03:35:20,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:35:20,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674056285] [2021-11-03 03:35:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:35:20,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:35:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:35:20,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-03 03:35:20,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:35:20,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674056285] [2021-11-03 03:35:20,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674056285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:35:20,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:35:20,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:35:20,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65036849] [2021-11-03 03:35:20,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:35:20,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:35:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:35:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:35:20,358 INFO L87 Difference]: Start difference. First operand 6847 states and 8749 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-03 03:35:22,404 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:35:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:35:42,788 INFO L93 Difference]: Finished difference Result 6847 states and 8749 transitions. [2021-11-03 03:35:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:35:42,789 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-03 03:35:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:35:42,813 INFO L225 Difference]: With dead ends: 6847 [2021-11-03 03:35:42,813 INFO L226 Difference]: Without dead ends: 6843 [2021-11-03 03:35:42,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.81ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:35:42,819 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4631 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20231.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 45.97ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21895.99ms IncrementalHoareTripleChecker+Time [2021-11-03 03:35:42,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4631 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 45.97ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 21895.99ms Time] [2021-11-03 03:35:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6843 states. [2021-11-03 03:35:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6843 to 6843. [2021-11-03 03:35:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6843 states, 6637 states have (on average 1.2995329215006781) internal successors, (8625), 6766 states have internal predecessors, (8625), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:35:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6843 states to 6843 states and 8745 transitions. [2021-11-03 03:35:42,976 INFO L78 Accepts]: Start accepts. Automaton has 6843 states and 8745 transitions. Word has length 28 [2021-11-03 03:35:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:35:42,977 INFO L470 AbstractCegarLoop]: Abstraction has 6843 states and 8745 transitions. [2021-11-03 03:35:42,977 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-03 03:35:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6843 states and 8745 transitions. [2021-11-03 03:35:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 03:35:42,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:35:42,978 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-03 03:35:42,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 03:35:42,979 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:35:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:35:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash 381190701, now seen corresponding path program 1 times [2021-11-03 03:35:42,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:35:42,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019152274] [2021-11-03 03:35:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:35:42,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:35:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:35:43,209 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-03 03:35:43,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:35:43,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019152274] [2021-11-03 03:35:43,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019152274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:35:43,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:35:43,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:35:43,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085231942] [2021-11-03 03:35:43,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:35:43,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:35:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:35:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:35:43,211 INFO L87 Difference]: Start difference. First operand 6843 states and 8745 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-03 03:35:45,255 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:36:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:36:05,806 INFO L93 Difference]: Finished difference Result 6843 states and 8745 transitions. [2021-11-03 03:36:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:36:05,807 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-03 03:36:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:36:05,825 INFO L225 Difference]: With dead ends: 6843 [2021-11-03 03:36:05,826 INFO L226 Difference]: Without dead ends: 6839 [2021-11-03 03:36:05,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.92ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:36:05,829 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4617 mSDsluCounter, 4353 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20392.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.09ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22136.08ms IncrementalHoareTripleChecker+Time [2021-11-03 03:36:05,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4617 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 42.09ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 22136.08ms Time] [2021-11-03 03:36:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2021-11-03 03:36:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 6839. [2021-11-03 03:36:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6839 states, 6635 states have (on average 1.2993217784476263) internal successors, (8621), 6762 states have internal predecessors, (8621), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:36:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6839 states to 6839 states and 8741 transitions. [2021-11-03 03:36:05,955 INFO L78 Accepts]: Start accepts. Automaton has 6839 states and 8741 transitions. Word has length 30 [2021-11-03 03:36:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:36:05,955 INFO L470 AbstractCegarLoop]: Abstraction has 6839 states and 8741 transitions. [2021-11-03 03:36:05,960 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-03 03:36:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6839 states and 8741 transitions. [2021-11-03 03:36:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 03:36:05,964 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:36:05,964 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-03 03:36:05,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 03:36:05,965 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:36:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:36:05,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1252496849, now seen corresponding path program 1 times [2021-11-03 03:36:05,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:36:05,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305976550] [2021-11-03 03:36:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:36:05,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:36:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:36:06,168 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-03 03:36:06,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:36:06,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305976550] [2021-11-03 03:36:06,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305976550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:36:06,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:36:06,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:36:06,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175553406] [2021-11-03 03:36:06,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:36:06,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:36:06,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:36:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:36:06,170 INFO L87 Difference]: Start difference. First operand 6839 states and 8741 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-03 03:36:08,204 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:36:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:36:27,936 INFO L93 Difference]: Finished difference Result 6839 states and 8741 transitions. [2021-11-03 03:36:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:36:27,947 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-03 03:36:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:36:27,969 INFO L225 Difference]: With dead ends: 6839 [2021-11-03 03:36:27,969 INFO L226 Difference]: Without dead ends: 6835 [2021-11-03 03:36:27,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:36:27,975 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4603 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19648.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4603 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 32.55ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21360.63ms IncrementalHoareTripleChecker+Time [2021-11-03 03:36:27,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4603 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 32.55ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 21360.63ms Time] [2021-11-03 03:36:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2021-11-03 03:36:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6835. [2021-11-03 03:36:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6835 states, 6633 states have (on average 1.299110508065732) internal successors, (8617), 6758 states have internal predecessors, (8617), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:36:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6835 states to 6835 states and 8737 transitions. [2021-11-03 03:36:28,107 INFO L78 Accepts]: Start accepts. Automaton has 6835 states and 8737 transitions. Word has length 32 [2021-11-03 03:36:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:36:28,107 INFO L470 AbstractCegarLoop]: Abstraction has 6835 states and 8737 transitions. [2021-11-03 03:36:28,107 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-03 03:36:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6835 states and 8737 transitions. [2021-11-03 03:36:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-03 03:36:28,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:36:28,110 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-03 03:36:28,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 03:36:28,110 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:36:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:36:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1059082709, now seen corresponding path program 1 times [2021-11-03 03:36:28,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:36:28,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972303124] [2021-11-03 03:36:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:36:28,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:36:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:36:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:36:28,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:36:28,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972303124] [2021-11-03 03:36:28,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972303124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:36:28,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:36:28,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:36:28,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210501913] [2021-11-03 03:36:28,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:36:28,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:36:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:36:28,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:36:28,274 INFO L87 Difference]: Start difference. First operand 6835 states and 8737 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-03 03:36:30,319 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:36:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:36:49,219 INFO L93 Difference]: Finished difference Result 6835 states and 8737 transitions. [2021-11-03 03:36:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:36:49,219 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-03 03:36:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:36:49,233 INFO L225 Difference]: With dead ends: 6835 [2021-11-03 03:36:49,233 INFO L226 Difference]: Without dead ends: 6831 [2021-11-03 03:36:49,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:36:49,237 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4589 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18911.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 33.74ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20543.73ms IncrementalHoareTripleChecker+Time [2021-11-03 03:36:49,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4589 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 33.74ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 20543.73ms Time] [2021-11-03 03:36:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6831 states. [2021-11-03 03:36:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6831 to 6831. [2021-11-03 03:36:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6831 states, 6631 states have (on average 1.2988991102397829) internal successors, (8613), 6754 states have internal predecessors, (8613), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:36:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 8733 transitions. [2021-11-03 03:36:49,449 INFO L78 Accepts]: Start accepts. Automaton has 6831 states and 8733 transitions. Word has length 34 [2021-11-03 03:36:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:36:49,449 INFO L470 AbstractCegarLoop]: Abstraction has 6831 states and 8733 transitions. [2021-11-03 03:36:49,449 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-03 03:36:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6831 states and 8733 transitions. [2021-11-03 03:36:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 03:36:49,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:36:49,452 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-03 03:36:49,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 03:36:49,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:36:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:36:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -128311751, now seen corresponding path program 1 times [2021-11-03 03:36:49,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:36:49,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85171349] [2021-11-03 03:36:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:36:49,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:36:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:36:49,627 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-03 03:36:49,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:36:49,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85171349] [2021-11-03 03:36:49,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85171349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:36:49,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:36:49,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:36:49,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072134346] [2021-11-03 03:36:49,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:36:49,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:36:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:36:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:36:49,630 INFO L87 Difference]: Start difference. First operand 6831 states and 8733 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-03 03:36:51,660 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:37:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:37:17,308 INFO L93 Difference]: Finished difference Result 6831 states and 8733 transitions. [2021-11-03 03:37:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:37:17,309 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-03 03:37:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:37:17,324 INFO L225 Difference]: With dead ends: 6831 [2021-11-03 03:37:17,325 INFO L226 Difference]: Without dead ends: 6827 [2021-11-03 03:37:17,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:37:17,331 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4575 mSDsluCounter, 4365 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24591.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4575 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 60.44ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27093.78ms IncrementalHoareTripleChecker+Time [2021-11-03 03:37:17,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4575 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 60.44ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 27093.78ms Time] [2021-11-03 03:37:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6827 states. [2021-11-03 03:37:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6827 to 6827. [2021-11-03 03:37:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6827 states, 6629 states have (on average 1.2986875848544275) internal successors, (8609), 6750 states have internal predecessors, (8609), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:37:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6827 states to 6827 states and 8729 transitions. [2021-11-03 03:37:17,482 INFO L78 Accepts]: Start accepts. Automaton has 6827 states and 8729 transitions. Word has length 36 [2021-11-03 03:37:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:37:17,482 INFO L470 AbstractCegarLoop]: Abstraction has 6827 states and 8729 transitions. [2021-11-03 03:37:17,482 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-03 03:37:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 6827 states and 8729 transitions. [2021-11-03 03:37:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-03 03:37:17,483 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:37:17,483 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-03 03:37:17,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 03:37:17,483 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:37:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:37:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1246913277, now seen corresponding path program 1 times [2021-11-03 03:37:17,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:37:17,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868436549] [2021-11-03 03:37:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:37:17,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:37:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:37:17,664 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-03 03:37:17,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:37:17,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868436549] [2021-11-03 03:37:17,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868436549] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:37:17,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:37:17,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:37:17,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545591383] [2021-11-03 03:37:17,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:37:17,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:37:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:37:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:37:17,666 INFO L87 Difference]: Start difference. First operand 6827 states and 8729 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-03 03:37:19,705 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:37:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:37:45,807 INFO L93 Difference]: Finished difference Result 6827 states and 8729 transitions. [2021-11-03 03:37:45,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:37:45,807 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-03 03:37:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:37:45,824 INFO L225 Difference]: With dead ends: 6827 [2021-11-03 03:37:45,825 INFO L226 Difference]: Without dead ends: 6823 [2021-11-03 03:37:45,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:37:45,829 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4561 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24988.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 57.88ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27559.81ms IncrementalHoareTripleChecker+Time [2021-11-03 03:37:45,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4561 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 57.88ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 27559.81ms Time] [2021-11-03 03:37:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2021-11-03 03:37:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6823. [2021-11-03 03:37:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6823 states, 6627 states have (on average 1.2984759317941754) internal successors, (8605), 6746 states have internal predecessors, (8605), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:37:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6823 states to 6823 states and 8725 transitions. [2021-11-03 03:37:45,971 INFO L78 Accepts]: Start accepts. Automaton has 6823 states and 8725 transitions. Word has length 38 [2021-11-03 03:37:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:37:45,971 INFO L470 AbstractCegarLoop]: Abstraction has 6823 states and 8725 transitions. [2021-11-03 03:37:45,971 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-03 03:37:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6823 states and 8725 transitions. [2021-11-03 03:37:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-03 03:37:45,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:37:45,972 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-03 03:37:45,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 03:37:45,972 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:37:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:37:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash -11761631, now seen corresponding path program 1 times [2021-11-03 03:37:45,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:37:45,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369022684] [2021-11-03 03:37:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:37:45,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:37:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:37:46,162 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-03 03:37:46,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:37:46,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369022684] [2021-11-03 03:37:46,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369022684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:37:46,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:37:46,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:37:46,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640233772] [2021-11-03 03:37:46,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:37:46,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:37:46,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:37:46,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:37:46,164 INFO L87 Difference]: Start difference. First operand 6823 states and 8725 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-03 03:37:48,199 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:38:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:38:12,765 INFO L93 Difference]: Finished difference Result 6823 states and 8725 transitions. [2021-11-03 03:38:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:38:12,766 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-03 03:38:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:38:12,781 INFO L225 Difference]: With dead ends: 6823 [2021-11-03 03:38:12,781 INFO L226 Difference]: Without dead ends: 6819 [2021-11-03 03:38:12,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:38:12,787 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4547 mSDsluCounter, 4373 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23390.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4547 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 52.20ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25979.07ms IncrementalHoareTripleChecker+Time [2021-11-03 03:38:12,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4547 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 52.20ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 25979.07ms Time] [2021-11-03 03:38:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2021-11-03 03:38:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 6819. [2021-11-03 03:38:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6819 states, 6625 states have (on average 1.2982641509433963) internal successors, (8601), 6742 states have internal predecessors, (8601), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:38:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6819 states to 6819 states and 8721 transitions. [2021-11-03 03:38:12,956 INFO L78 Accepts]: Start accepts. Automaton has 6819 states and 8721 transitions. Word has length 40 [2021-11-03 03:38:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:38:12,957 INFO L470 AbstractCegarLoop]: Abstraction has 6819 states and 8721 transitions. [2021-11-03 03:38:12,957 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-03 03:38:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6819 states and 8721 transitions. [2021-11-03 03:38:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-03 03:38:12,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:38:12,959 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-03 03:38:12,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 03:38:12,959 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:38:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:38:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -302839317, now seen corresponding path program 1 times [2021-11-03 03:38:12,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:38:12,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118425582] [2021-11-03 03:38:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:38:12,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:38:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:38:15,728 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-03 03:38:15,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:38:15,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118425582] [2021-11-03 03:38:15,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118425582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:38:15,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:38:15,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-03 03:38:15,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654143852] [2021-11-03 03:38:15,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 03:38:15,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:38:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 03:38:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-03 03:38:15,729 INFO L87 Difference]: Start difference. First operand 6819 states and 8721 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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-03 03:38:17,936 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:40:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:57,007 INFO L93 Difference]: Finished difference Result 7494 states and 9532 transitions. [2021-11-03 03:40:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 03:40:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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-03 03:40:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:57,020 INFO L225 Difference]: With dead ends: 7494 [2021-11-03 03:40:57,020 INFO L226 Difference]: Without dead ends: 6901 [2021-11-03 03:40:57,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1817.93ms TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2021-11-03 03:40:57,025 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 843 mSDsluCounter, 53633 mSDsCounter, 0 mSdLazyCounter, 57681 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 148456.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 57693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 348.88ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 158390.37ms IncrementalHoareTripleChecker+Time [2021-11-03 03:40:57,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 624 Invalid, 57693 Unknown, 0 Unchecked, 348.88ms Time], IncrementalHoareTripleChecker [11 Valid, 57681 Invalid, 1 Unknown, 0 Unchecked, 158390.37ms Time] [2021-11-03 03:40:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2021-11-03 03:40:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6832. [2021-11-03 03:40:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6832 states, 6638 states have (on average 1.2976800241036457) internal successors, (8614), 6755 states have internal predecessors, (8614), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:40:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 8734 transitions. [2021-11-03 03:40:57,191 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 8734 transitions. Word has length 40 [2021-11-03 03:40:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:57,191 INFO L470 AbstractCegarLoop]: Abstraction has 6832 states and 8734 transitions. [2021-11-03 03:40:57,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 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-03 03:40:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 8734 transitions. [2021-11-03 03:40:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 03:40:57,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:40:57,192 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-03 03:40:57,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 03:40:57,192 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:40:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1582428612, now seen corresponding path program 1 times [2021-11-03 03:40:57,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:40:57,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378218456] [2021-11-03 03:40:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:57,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:57,372 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-03 03:40:57,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:40:57,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378218456] [2021-11-03 03:40:57,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378218456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:57,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:57,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:40:57,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457900480] [2021-11-03 03:40:57,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:40:57,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:40:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:40:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:40:57,373 INFO L87 Difference]: Start difference. First operand 6832 states and 8734 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-03 03:40:59,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:41:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:41:27,840 INFO L93 Difference]: Finished difference Result 6832 states and 8734 transitions. [2021-11-03 03:41:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:41:27,841 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-03 03:41:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:41:27,856 INFO L225 Difference]: With dead ends: 6832 [2021-11-03 03:41:27,856 INFO L226 Difference]: Without dead ends: 6828 [2021-11-03 03:41:27,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.78ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:41:27,861 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4533 mSDsluCounter, 4377 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26723.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 58.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29854.55ms IncrementalHoareTripleChecker+Time [2021-11-03 03:41:27,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4533 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 58.43ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 29854.55ms Time] [2021-11-03 03:41:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2021-11-03 03:41:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 6828. [2021-11-03 03:41:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6828 states, 6636 states have (on average 1.2974683544303798) internal successors, (8610), 6751 states have internal predecessors, (8610), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:41:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6828 states to 6828 states and 8730 transitions. [2021-11-03 03:41:28,038 INFO L78 Accepts]: Start accepts. Automaton has 6828 states and 8730 transitions. Word has length 42 [2021-11-03 03:41:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:41:28,038 INFO L470 AbstractCegarLoop]: Abstraction has 6828 states and 8730 transitions. [2021-11-03 03:41:28,038 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-03 03:41:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6828 states and 8730 transitions. [2021-11-03 03:41:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 03:41:28,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:41:28,039 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-03 03:41:28,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 03:41:28,039 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:41:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:41:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 295928776, now seen corresponding path program 1 times [2021-11-03 03:41:28,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:41:28,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817081222] [2021-11-03 03:41:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:41:28,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:41:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:41:28,232 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-03 03:41:28,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:41:28,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817081222] [2021-11-03 03:41:28,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817081222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:41:28,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:41:28,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:41:28,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611138009] [2021-11-03 03:41:28,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:41:28,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:41:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:41:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:41:28,234 INFO L87 Difference]: Start difference. First operand 6828 states and 8730 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-03 03:41:30,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:41:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:41:57,734 INFO L93 Difference]: Finished difference Result 6828 states and 8730 transitions. [2021-11-03 03:41:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:41:57,734 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-03 03:41:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:41:57,745 INFO L225 Difference]: With dead ends: 6828 [2021-11-03 03:41:57,746 INFO L226 Difference]: Without dead ends: 6824 [2021-11-03 03:41:57,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.81ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:41:57,749 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4519 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25753.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4519 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 56.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28876.26ms IncrementalHoareTripleChecker+Time [2021-11-03 03:41:57,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4519 Valid, 96 Invalid, 8759 Unknown, 0 Unchecked, 56.43ms Time], IncrementalHoareTripleChecker [2 Valid, 8756 Invalid, 1 Unknown, 0 Unchecked, 28876.26ms Time] [2021-11-03 03:41:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2021-11-03 03:41:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 6824. [2021-11-03 03:41:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 6634 states have (on average 1.2972565571299366) internal successors, (8606), 6747 states have internal predecessors, (8606), 48 states have call successors, (48), 30 states have call predecessors, (48), 30 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-03 03:41:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 8726 transitions. [2021-11-03 03:41:58,014 INFO L78 Accepts]: Start accepts. Automaton has 6824 states and 8726 transitions. Word has length 44 [2021-11-03 03:41:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:41:58,014 INFO L470 AbstractCegarLoop]: Abstraction has 6824 states and 8726 transitions. [2021-11-03 03:41:58,014 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-03 03:41:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6824 states and 8726 transitions. [2021-11-03 03:41:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-03 03:41:58,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:41:58,015 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-03 03:41:58,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 03:41:58,015 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:41:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:41:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1006825962, now seen corresponding path program 1 times [2021-11-03 03:41:58,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:41:58,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286685841] [2021-11-03 03:41:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:41:58,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:41:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:41:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-03 03:41:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:41:58,250 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-03 03:41:58,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:41:58,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286685841] [2021-11-03 03:41:58,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286685841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:41:58,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:41:58,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:41:58,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195813399] [2021-11-03 03:41:58,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:41:58,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:41:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:41:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:41:58,252 INFO L87 Difference]: Start difference. First operand 6824 states and 8726 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 03:42:01,251 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:42:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:42:31,243 INFO L93 Difference]: Finished difference Result 13708 states and 17548 transitions. [2021-11-03 03:42:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:42:31,243 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-11-03 03:42:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:42:31,258 INFO L225 Difference]: With dead ends: 13708 [2021-11-03 03:42:31,258 INFO L226 Difference]: Without dead ends: 6928 [2021-11-03 03:42:31,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 131.32ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:42:31,276 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 4575 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 8863 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28616.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 85.14ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 8863 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32172.66ms IncrementalHoareTripleChecker+Time [2021-11-03 03:42:31,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4583 Valid, 49 Invalid, 8919 Unknown, 0 Unchecked, 85.14ms Time], IncrementalHoareTripleChecker [55 Valid, 8863 Invalid, 1 Unknown, 0 Unchecked, 32172.66ms Time] [2021-11-03 03:42:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2021-11-03 03:42:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6858. [2021-11-03 03:42:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6858 states, 6665 states have (on average 1.2964741185296325) internal successors, (8641), 6780 states have internal predecessors, (8641), 48 states have call successors, (48), 30 states have call predecessors, (48), 34 states have return successors, (82), 49 states have call predecessors, (82), 48 states have call successors, (82) [2021-11-03 03:42:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 8771 transitions. [2021-11-03 03:42:31,473 INFO L78 Accepts]: Start accepts. Automaton has 6858 states and 8771 transitions. Word has length 46 [2021-11-03 03:42:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:42:31,474 INFO L470 AbstractCegarLoop]: Abstraction has 6858 states and 8771 transitions. [2021-11-03 03:42:31,474 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 03:42:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6858 states and 8771 transitions. [2021-11-03 03:42:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-03 03:42:31,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:42:31,475 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-03 03:42:31,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 03:42:31,475 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:42:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:42:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash 920167980, now seen corresponding path program 1 times [2021-11-03 03:42:31,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:42:31,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155734844] [2021-11-03 03:42:31,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:42:31,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:42:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:42:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:42:31,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:42:31,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155734844] [2021-11-03 03:42:31,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155734844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:42:31,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:42:31,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:42:31,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871751588] [2021-11-03 03:42:31,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:42:31,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:42:31,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:42:31,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:42:31,640 INFO L87 Difference]: Start difference. First operand 6858 states and 8771 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-03 03:42:33,681 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:43:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:43:00,798 INFO L93 Difference]: Finished difference Result 6858 states and 8771 transitions. [2021-11-03 03:43:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:43:00,799 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-03 03:43:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:43:00,806 INFO L225 Difference]: With dead ends: 6858 [2021-11-03 03:43:00,806 INFO L226 Difference]: Without dead ends: 6854 [2021-11-03 03:43:00,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:43:00,808 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4501 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 8748 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25262.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4501 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 59.90ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8748 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28447.67ms IncrementalHoareTripleChecker+Time [2021-11-03 03:43:00,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4501 Valid, 96 Invalid, 8751 Unknown, 0 Unchecked, 59.90ms Time], IncrementalHoareTripleChecker [2 Valid, 8748 Invalid, 1 Unknown, 0 Unchecked, 28447.67ms Time] [2021-11-03 03:43:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2021-11-03 03:43:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6854. [2021-11-03 03:43:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6854 states, 6663 states have (on average 1.2962629446195408) internal successors, (8637), 6776 states have internal predecessors, (8637), 48 states have call successors, (48), 30 states have call predecessors, (48), 34 states have return successors, (82), 49 states have call predecessors, (82), 48 states have call successors, (82) [2021-11-03 03:43:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6854 states to 6854 states and 8767 transitions. [2021-11-03 03:43:00,988 INFO L78 Accepts]: Start accepts. Automaton has 6854 states and 8767 transitions. Word has length 46 [2021-11-03 03:43:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:43:00,988 INFO L470 AbstractCegarLoop]: Abstraction has 6854 states and 8767 transitions. [2021-11-03 03:43:00,988 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-03 03:43:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states and 8767 transitions. [2021-11-03 03:43:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-03 03:43:00,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:43:00,989 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-03 03:43:00,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 03:43:00,989 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:43:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:43:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1477068798, now seen corresponding path program 1 times [2021-11-03 03:43:00,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:43:00,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892043381] [2021-11-03 03:43:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:43:00,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:43:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:43:01,239 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-03 03:43:01,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:43:01,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892043381] [2021-11-03 03:43:01,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892043381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:43:01,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:43:01,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:43:01,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680064608] [2021-11-03 03:43:01,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:43:01,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:43:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:43:01,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:43:01,240 INFO L87 Difference]: Start difference. First operand 6854 states and 8767 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:43:03,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:43:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:43:45,901 INFO L93 Difference]: Finished difference Result 14352 states and 18422 transitions. [2021-11-03 03:43:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:43:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-03 03:43:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:43:45,919 INFO L225 Difference]: With dead ends: 14352 [2021-11-03 03:43:45,919 INFO L226 Difference]: Without dead ends: 7542 [2021-11-03 03:43:45,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.71ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:43:45,941 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 4292 mSDsluCounter, 9475 mSDsCounter, 0 mSdLazyCounter, 13801 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39222.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4292 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 13809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 96.18ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13801 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43759.89ms IncrementalHoareTripleChecker+Time [2021-11-03 03:43:45,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4292 Valid, 172 Invalid, 13809 Unknown, 0 Unchecked, 96.18ms Time], IncrementalHoareTripleChecker [7 Valid, 13801 Invalid, 1 Unknown, 0 Unchecked, 43759.89ms Time] [2021-11-03 03:43:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2021-11-03 03:43:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 7526. [2021-11-03 03:43:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7526 states, 7315 states have (on average 1.2963773069036226) internal successors, (9483), 7432 states have internal predecessors, (9483), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:43:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7526 states to 7526 states and 9642 transitions. [2021-11-03 03:43:46,170 INFO L78 Accepts]: Start accepts. Automaton has 7526 states and 9642 transitions. Word has length 48 [2021-11-03 03:43:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:43:46,171 INFO L470 AbstractCegarLoop]: Abstraction has 7526 states and 9642 transitions. [2021-11-03 03:43:46,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:43:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7526 states and 9642 transitions. [2021-11-03 03:43:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-03 03:43:46,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:43:46,172 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-03 03:43:46,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 03:43:46,172 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:43:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:43:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1477128380, now seen corresponding path program 1 times [2021-11-03 03:43:46,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:43:46,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957682759] [2021-11-03 03:43:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:43:46,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:43:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:43:46,316 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-03 03:43:46,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:43:46,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957682759] [2021-11-03 03:43:46,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957682759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:43:46,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:43:46,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:43:46,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854176677] [2021-11-03 03:43:46,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:43:46,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:43:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:43:46,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:43:46,317 INFO L87 Difference]: Start difference. First operand 7526 states and 9642 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:43:48,360 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:44:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:44:30,346 INFO L93 Difference]: Finished difference Result 7532 states and 9650 transitions. [2021-11-03 03:44:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:44:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-03 03:44:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:44:30,361 INFO L225 Difference]: With dead ends: 7532 [2021-11-03 03:44:30,361 INFO L226 Difference]: Without dead ends: 7530 [2021-11-03 03:44:30,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.83ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:44:30,365 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 8854 mSDsCounter, 0 mSdLazyCounter, 13173 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38632.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 81.06ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43200.67ms IncrementalHoareTripleChecker+Time [2021-11-03 03:44:30,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 146 Invalid, 13178 Unknown, 0 Unchecked, 81.06ms Time], IncrementalHoareTripleChecker [4 Valid, 13173 Invalid, 1 Unknown, 0 Unchecked, 43200.67ms Time] [2021-11-03 03:44:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2021-11-03 03:44:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 7524. [2021-11-03 03:44:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7524 states, 7314 states have (on average 1.296007656549084) internal successors, (9479), 7430 states have internal predecessors, (9479), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:44:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7524 states to 7524 states and 9638 transitions. [2021-11-03 03:44:30,592 INFO L78 Accepts]: Start accepts. Automaton has 7524 states and 9638 transitions. Word has length 48 [2021-11-03 03:44:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:44:30,592 INFO L470 AbstractCegarLoop]: Abstraction has 7524 states and 9638 transitions. [2021-11-03 03:44:30,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:44:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7524 states and 9638 transitions. [2021-11-03 03:44:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-03 03:44:30,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:44:30,593 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-03 03:44:30,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 03:44:30,594 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:44:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:44:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash -481378064, now seen corresponding path program 1 times [2021-11-03 03:44:30,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:44:30,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995812685] [2021-11-03 03:44:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:44:30,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:44:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:44:30,766 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-03 03:44:30,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:44:30,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995812685] [2021-11-03 03:44:30,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995812685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:44:30,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:44:30,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:44:30,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141644271] [2021-11-03 03:44:30,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:44:30,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:44:30,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:44:30,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:44:30,767 INFO L87 Difference]: Start difference. First operand 7524 states and 9638 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-03 03:44:33,101 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-03 03:45:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:05,115 INFO L93 Difference]: Finished difference Result 7524 states and 9638 transitions. [2021-11-03 03:45:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:45:05,116 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-03 03:45:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:05,131 INFO L225 Difference]: With dead ends: 7524 [2021-11-03 03:45:05,131 INFO L226 Difference]: Without dead ends: 7520 [2021-11-03 03:45:05,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.23ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:45:05,135 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4484 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 8742 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29375.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4484 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 66.58ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8742 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33588.96ms IncrementalHoareTripleChecker+Time [2021-11-03 03:45:05,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4484 Valid, 96 Invalid, 8745 Unknown, 0 Unchecked, 66.58ms Time], IncrementalHoareTripleChecker [2 Valid, 8742 Invalid, 1 Unknown, 0 Unchecked, 33588.96ms Time] [2021-11-03 03:45:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2021-11-03 03:45:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 7520. [2021-11-03 03:45:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7520 states, 7312 states have (on average 1.2958150984682713) internal successors, (9475), 7426 states have internal predecessors, (9475), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:45:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7520 states to 7520 states and 9634 transitions. [2021-11-03 03:45:05,378 INFO L78 Accepts]: Start accepts. Automaton has 7520 states and 9634 transitions. Word has length 48 [2021-11-03 03:45:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:05,378 INFO L470 AbstractCegarLoop]: Abstraction has 7520 states and 9634 transitions. [2021-11-03 03:45:05,378 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-03 03:45:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 7520 states and 9634 transitions. [2021-11-03 03:45:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-03 03:45:05,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:45:05,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:45:05,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 03:45:05,379 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:45:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2032833628, now seen corresponding path program 1 times [2021-11-03 03:45:05,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:45:05,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330152378] [2021-11-03 03:45:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:05,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:45:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-03 03:45:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:05,667 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-03 03:45:05,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:45:05,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330152378] [2021-11-03 03:45:05,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330152378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:05,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:05,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 03:45:05,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849998174] [2021-11-03 03:45:05,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 03:45:05,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:45:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 03:45:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:45:05,670 INFO L87 Difference]: Start difference. First operand 7520 states and 9634 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 03:45:07,757 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:45:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:41,174 INFO L93 Difference]: Finished difference Result 15064 states and 19314 transitions. [2021-11-03 03:45:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:45:41,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-11-03 03:45:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:41,192 INFO L225 Difference]: With dead ends: 15064 [2021-11-03 03:45:41,193 INFO L226 Difference]: Without dead ends: 7588 [2021-11-03 03:45:41,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 269.49ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:45:41,211 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 13303 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 8923 mSolverCounterSat, 269 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30097.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13303 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 9193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 132.48ms SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 8923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34464.52ms IncrementalHoareTripleChecker+Time [2021-11-03 03:45:41,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13303 Valid, 49 Invalid, 9193 Unknown, 0 Unchecked, 132.48ms Time], IncrementalHoareTripleChecker [269 Valid, 8923 Invalid, 1 Unknown, 0 Unchecked, 34464.52ms Time] [2021-11-03 03:45:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2021-11-03 03:45:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 7516. [2021-11-03 03:45:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7516 states, 7309 states have (on average 1.2953892461349021) internal successors, (9468), 7422 states have internal predecessors, (9468), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:45:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 9627 transitions. [2021-11-03 03:45:41,460 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 9627 transitions. Word has length 49 [2021-11-03 03:45:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:41,460 INFO L470 AbstractCegarLoop]: Abstraction has 7516 states and 9627 transitions. [2021-11-03 03:45:41,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 03:45:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 9627 transitions. [2021-11-03 03:45:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 03:45:41,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:45:41,461 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-03 03:45:41,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 03:45:41,461 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:45:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1252604948, now seen corresponding path program 1 times [2021-11-03 03:45:41,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:45:41,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147174670] [2021-11-03 03:45:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:41,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:45:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:41,650 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-03 03:45:41,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:45:41,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147174670] [2021-11-03 03:45:41,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147174670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:41,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:41,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:45:41,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500359807] [2021-11-03 03:45:41,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:45:41,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:45:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:45:41,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:45:41,651 INFO L87 Difference]: Start difference. First operand 7516 states and 9627 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-03 03:45:44,788 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:46:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:15,634 INFO L93 Difference]: Finished difference Result 7516 states and 9627 transitions. [2021-11-03 03:46:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:46:15,634 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-03 03:46:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:15,647 INFO L225 Difference]: With dead ends: 7516 [2021-11-03 03:46:15,647 INFO L226 Difference]: Without dead ends: 7512 [2021-11-03 03:46:15,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:46:15,651 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4466 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 8734 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28988.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 60.04ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33247.02ms IncrementalHoareTripleChecker+Time [2021-11-03 03:46:15,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4466 Valid, 96 Invalid, 8737 Unknown, 0 Unchecked, 60.04ms Time], IncrementalHoareTripleChecker [2 Valid, 8734 Invalid, 1 Unknown, 0 Unchecked, 33247.02ms Time] [2021-11-03 03:46:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2021-11-03 03:46:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 7512. [2021-11-03 03:46:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7512 states, 7307 states have (on average 1.2951963870261394) internal successors, (9464), 7418 states have internal predecessors, (9464), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:46:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 9623 transitions. [2021-11-03 03:46:15,997 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 9623 transitions. Word has length 50 [2021-11-03 03:46:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:15,997 INFO L470 AbstractCegarLoop]: Abstraction has 7512 states and 9623 transitions. [2021-11-03 03:46:15,997 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-03 03:46:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 9623 transitions. [2021-11-03 03:46:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 03:46:15,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:46:15,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:46:15,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 03:46:15,998 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:46:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1098650111, now seen corresponding path program 1 times [2021-11-03 03:46:15,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:46:15,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959438539] [2021-11-03 03:46:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:15,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:46:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:16,131 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-03 03:46:16,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:46:16,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959438539] [2021-11-03 03:46:16,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959438539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:16,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:16,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:46:16,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035755779] [2021-11-03 03:46:16,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:46:16,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:46:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:46:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:46:16,134 INFO L87 Difference]: Start difference. First operand 7512 states and 9623 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:18,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:46:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:37,809 INFO L93 Difference]: Finished difference Result 14923 states and 19172 transitions. [2021-11-03 03:46:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:46:37,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-03 03:46:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:37,823 INFO L225 Difference]: With dead ends: 14923 [2021-11-03 03:46:37,823 INFO L226 Difference]: Without dead ends: 7455 [2021-11-03 03:46:37,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.77ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:46:37,842 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4345 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17672.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4345 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 4358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.83ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20953.93ms IncrementalHoareTripleChecker+Time [2021-11-03 03:46:37,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4345 Valid, 48 Invalid, 4358 Unknown, 0 Unchecked, 23.83ms Time], IncrementalHoareTripleChecker [13 Valid, 4344 Invalid, 1 Unknown, 0 Unchecked, 20953.93ms Time] [2021-11-03 03:46:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2021-11-03 03:46:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2021-11-03 03:46:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7264 states have (on average 1.2889592511013215) internal successors, (9363), 7361 states have internal predecessors, (9363), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:46:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9522 transitions. [2021-11-03 03:46:38,078 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9522 transitions. Word has length 51 [2021-11-03 03:46:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:38,078 INFO L470 AbstractCegarLoop]: Abstraction has 7455 states and 9522 transitions. [2021-11-03 03:46:38,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9522 transitions. [2021-11-03 03:46:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-03 03:46:38,079 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:46:38,079 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-03 03:46:38,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 03:46:38,079 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:46:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1162968984, now seen corresponding path program 1 times [2021-11-03 03:46:38,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:46:38,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429768207] [2021-11-03 03:46:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:38,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:46:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:38,229 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-03 03:46:38,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:46:38,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429768207] [2021-11-03 03:46:38,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429768207] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:38,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:38,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:46:38,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255507334] [2021-11-03 03:46:38,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:46:38,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:46:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:46:38,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:46:38,231 INFO L87 Difference]: Start difference. First operand 7455 states and 9522 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-03 03:46:40,617 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:47:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:11,884 INFO L93 Difference]: Finished difference Result 7455 states and 9522 transitions. [2021-11-03 03:47:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:47:11,887 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-03 03:47:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:11,899 INFO L225 Difference]: With dead ends: 7455 [2021-11-03 03:47:11,900 INFO L226 Difference]: Without dead ends: 7451 [2021-11-03 03:47:11,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:11,904 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4396 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28296.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 64.55ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32867.49ms IncrementalHoareTripleChecker+Time [2021-11-03 03:47:11,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4396 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 64.55ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 32867.49ms Time] [2021-11-03 03:47:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2021-11-03 03:47:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7451. [2021-11-03 03:47:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 7262 states have (on average 1.2887634260534289) internal successors, (9359), 7357 states have internal predecessors, (9359), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:47:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9518 transitions. [2021-11-03 03:47:12,158 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9518 transitions. Word has length 52 [2021-11-03 03:47:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:12,158 INFO L470 AbstractCegarLoop]: Abstraction has 7451 states and 9518 transitions. [2021-11-03 03:47:12,158 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-03 03:47:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9518 transitions. [2021-11-03 03:47:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-03 03:47:12,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:47:12,159 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-03 03:47:12,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-03 03:47:12,160 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:47:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 922153852, now seen corresponding path program 1 times [2021-11-03 03:47:12,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:47:12,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523600526] [2021-11-03 03:47:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:12,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:12,337 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-03 03:47:12,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:47:12,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523600526] [2021-11-03 03:47:12,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523600526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:12,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:12,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:47:12,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148955851] [2021-11-03 03:47:12,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:47:12,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:47:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:47:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:47:12,339 INFO L87 Difference]: Start difference. First operand 7451 states and 9518 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-03 03:47:14,387 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 03:47:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:46,549 INFO L93 Difference]: Finished difference Result 7451 states and 9518 transitions. [2021-11-03 03:47:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:47:46,550 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 54 [2021-11-03 03:47:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:46,563 INFO L225 Difference]: With dead ends: 7451 [2021-11-03 03:47:46,564 INFO L226 Difference]: Without dead ends: 7447 [2021-11-03 03:47:46,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.93ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:46,568 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4382 mSDsluCounter, 4334 mSDsCounter, 0 mSdLazyCounter, 8622 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28705.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 8625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 65.05ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8622 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33373.63ms IncrementalHoareTripleChecker+Time [2021-11-03 03:47:46,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4382 Valid, 96 Invalid, 8625 Unknown, 0 Unchecked, 65.05ms Time], IncrementalHoareTripleChecker [2 Valid, 8622 Invalid, 1 Unknown, 0 Unchecked, 33373.63ms Time] [2021-11-03 03:47:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2021-11-03 03:47:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 7447. [2021-11-03 03:47:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 7260 states have (on average 1.2885674931129476) internal successors, (9355), 7353 states have internal predecessors, (9355), 58 states have call successors, (58), 38 states have call predecessors, (58), 44 states have return successors, (101), 59 states have call predecessors, (101), 58 states have call successors, (101) [2021-11-03 03:47:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 9514 transitions. [2021-11-03 03:47:46,857 INFO L78 Accepts]: Start accepts. Automaton has 7447 states and 9514 transitions. Word has length 54 [2021-11-03 03:47:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:46,857 INFO L470 AbstractCegarLoop]: Abstraction has 7447 states and 9514 transitions. [2021-11-03 03:47:46,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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-03 03:47:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7447 states and 9514 transitions. [2021-11-03 03:47:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-03 03:47:46,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 03:47:46,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:46,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 03:47:46,858 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [fore200e_pca_detectErr0ASSERT_VIOLATIONERROR_FUNCTION, fore200e_pca_detectErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 127 more)] === [2021-11-03 03:47:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1427046336, now seen corresponding path program 1 times [2021-11-03 03:47:46,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 03:47:46,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094351285] [2021-11-03 03:47:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:46,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:47,137 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-03 03:47:47,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 03:47:47,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094351285] [2021-11-03 03:47:47,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094351285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:47,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:47,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:47:47,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687883635] [2021-11-03 03:47:47,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:47:47,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 03:47:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:47:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:47:47,139 INFO L87 Difference]: Start difference. First operand 7447 states and 9514 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:47:49,189 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15