./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.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 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:50:12,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:50:12,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:50:12,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:50:12,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:50:12,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:50:12,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:50:12,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:50:12,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:50:12,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:50:12,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:50:12,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:50:12,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:50:12,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:50:12,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:50:12,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:50:12,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:50:12,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:50:12,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:50:12,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:50:12,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:50:12,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:50:12,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:50:12,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:50:12,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:50:12,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:50:12,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:50:12,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:50:12,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:50:12,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:50:12,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:50:12,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:50:12,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:50:12,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:50:12,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:50:12,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:50:12,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:50:12,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:50:12,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:50:12,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:50:12,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:50:12,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:50:12,366 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:50:12,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:50:12,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:50:12,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:50:12,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:50:12,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:50:12,372 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:50:12,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:50:12,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:50:12,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:50:12,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:50:12,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:50:12,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:50:12,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:50:12,374 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:50:12,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:50:12,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:50:12,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:50:12,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:50:12,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:50:12,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:50:12,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:50:12,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:50:12,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:50:12,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:50:12,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:50:12,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:50:12,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:50:12,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:50:12,377 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 -> 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 [2021-11-06 21:50:12,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:50:12,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:50:12,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:50:12,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:50:12,564 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:50:12,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2021-11-06 21:50:12,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c52c8832/f02c35c34ce441a79e146ba49736c058/FLAG5774b43f9 [2021-11-06 21:50:13,342 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:50:13,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2021-11-06 21:50:13,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c52c8832/f02c35c34ce441a79e146ba49736c058/FLAG5774b43f9 [2021-11-06 21:50:13,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c52c8832/f02c35c34ce441a79e146ba49736c058 [2021-11-06 21:50:13,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:50:13,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:50:13,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:50:13,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:50:13,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:50:13,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:50:13" (1/1) ... [2021-11-06 21:50:13,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b03a4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:13, skipping insertion in model container [2021-11-06 21:50:13,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:50:13" (1/1) ... [2021-11-06 21:50:13,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:50:13,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:50:17,721 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2021-11-06 21:50:17,726 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2021-11-06 21:50:17,727 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2021-11-06 21:50:17,727 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2021-11-06 21:50:17,728 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2021-11-06 21:50:17,728 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2021-11-06 21:50:17,728 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2021-11-06 21:50:17,729 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2021-11-06 21:50:17,729 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2021-11-06 21:50:17,729 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2021-11-06 21:50:17,730 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2021-11-06 21:50:17,730 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2021-11-06 21:50:17,730 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2021-11-06 21:50:17,731 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2021-11-06 21:50:17,731 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2021-11-06 21:50:17,731 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2021-11-06 21:50:17,732 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2021-11-06 21:50:17,732 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2021-11-06 21:50:17,732 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2021-11-06 21:50:17,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2021-11-06 21:50:17,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2021-11-06 21:50:17,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2021-11-06 21:50:17,734 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2021-11-06 21:50:17,734 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2021-11-06 21:50:17,734 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2021-11-06 21:50:17,735 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2021-11-06 21:50:17,735 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2021-11-06 21:50:17,735 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2021-11-06 21:50:17,736 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2021-11-06 21:50:17,736 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2021-11-06 21:50:17,736 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2021-11-06 21:50:17,736 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2021-11-06 21:50:17,737 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2021-11-06 21:50:17,737 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2021-11-06 21:50:17,737 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2021-11-06 21:50:17,738 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2021-11-06 21:50:17,738 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2021-11-06 21:50:17,738 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2021-11-06 21:50:17,739 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2021-11-06 21:50:17,739 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2021-11-06 21:50:17,739 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2021-11-06 21:50:17,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2021-11-06 21:50:17,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2021-11-06 21:50:17,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2021-11-06 21:50:17,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2021-11-06 21:50:17,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2021-11-06 21:50:17,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2021-11-06 21:50:17,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2021-11-06 21:50:17,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2021-11-06 21:50:17,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2021-11-06 21:50:17,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2021-11-06 21:50:17,743 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2021-11-06 21:50:17,743 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2021-11-06 21:50:17,743 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2021-11-06 21:50:17,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2021-11-06 21:50:17,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2021-11-06 21:50:17,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2021-11-06 21:50:17,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2021-11-06 21:50:17,745 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2021-11-06 21:50:17,745 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2021-11-06 21:50:17,745 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2021-11-06 21:50:17,746 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2021-11-06 21:50:17,746 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2021-11-06 21:50:17,746 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2021-11-06 21:50:17,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2021-11-06 21:50:17,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2021-11-06 21:50:17,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2021-11-06 21:50:17,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2021-11-06 21:50:17,748 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2021-11-06 21:50:17,748 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2021-11-06 21:50:17,748 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2021-11-06 21:50:17,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2021-11-06 21:50:17,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2021-11-06 21:50:17,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2021-11-06 21:50:17,750 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2021-11-06 21:50:17,750 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2021-11-06 21:50:17,750 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2021-11-06 21:50:17,750 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2021-11-06 21:50:17,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2021-11-06 21:50:17,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2021-11-06 21:50:17,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2021-11-06 21:50:17,752 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2021-11-06 21:50:17,752 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2021-11-06 21:50:17,752 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2021-11-06 21:50:17,752 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2021-11-06 21:50:17,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2021-11-06 21:50:17,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2021-11-06 21:50:17,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2021-11-06 21:50:17,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:50:17,814 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:50:18,166 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2021-11-06 21:50:18,167 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2021-11-06 21:50:18,167 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2021-11-06 21:50:18,168 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2021-11-06 21:50:18,168 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2021-11-06 21:50:18,169 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2021-11-06 21:50:18,169 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2021-11-06 21:50:18,170 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2021-11-06 21:50:18,171 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2021-11-06 21:50:18,171 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2021-11-06 21:50:18,172 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2021-11-06 21:50:18,172 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2021-11-06 21:50:18,172 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2021-11-06 21:50:18,173 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2021-11-06 21:50:18,173 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2021-11-06 21:50:18,173 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2021-11-06 21:50:18,174 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2021-11-06 21:50:18,179 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2021-11-06 21:50:18,179 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2021-11-06 21:50:18,180 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2021-11-06 21:50:18,180 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2021-11-06 21:50:18,180 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2021-11-06 21:50:18,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2021-11-06 21:50:18,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2021-11-06 21:50:18,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2021-11-06 21:50:18,182 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2021-11-06 21:50:18,182 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2021-11-06 21:50:18,182 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2021-11-06 21:50:18,183 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2021-11-06 21:50:18,183 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2021-11-06 21:50:18,183 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2021-11-06 21:50:18,183 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2021-11-06 21:50:18,184 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2021-11-06 21:50:18,184 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2021-11-06 21:50:18,184 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2021-11-06 21:50:18,185 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2021-11-06 21:50:18,185 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2021-11-06 21:50:18,185 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2021-11-06 21:50:18,186 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2021-11-06 21:50:18,186 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2021-11-06 21:50:18,187 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2021-11-06 21:50:18,187 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2021-11-06 21:50:18,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2021-11-06 21:50:18,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2021-11-06 21:50:18,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2021-11-06 21:50:18,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2021-11-06 21:50:18,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2021-11-06 21:50:18,189 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2021-11-06 21:50:18,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2021-11-06 21:50:18,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2021-11-06 21:50:18,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2021-11-06 21:50:18,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2021-11-06 21:50:18,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2021-11-06 21:50:18,191 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2021-11-06 21:50:18,192 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2021-11-06 21:50:18,192 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2021-11-06 21:50:18,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2021-11-06 21:50:18,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2021-11-06 21:50:18,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2021-11-06 21:50:18,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2021-11-06 21:50:18,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2021-11-06 21:50:18,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2021-11-06 21:50:18,195 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2021-11-06 21:50:18,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2021-11-06 21:50:18,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2021-11-06 21:50:18,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2021-11-06 21:50:18,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2021-11-06 21:50:18,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2021-11-06 21:50:18,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2021-11-06 21:50:18,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2021-11-06 21:50:18,206 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2021-11-06 21:50:18,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2021-11-06 21:50:18,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2021-11-06 21:50:18,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2021-11-06 21:50:18,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2021-11-06 21:50:18,211 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2021-11-06 21:50:18,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2021-11-06 21:50:18,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2021-11-06 21:50:18,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2021-11-06 21:50:18,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2021-11-06 21:50:18,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2021-11-06 21:50:18,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2021-11-06 21:50:18,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2021-11-06 21:50:18,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2021-11-06 21:50:18,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2021-11-06 21:50:18,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2021-11-06 21:50:18,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2021-11-06 21:50:18,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2021-11-06 21:50:18,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:50:18,539 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:50:18,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18 WrapperNode [2021-11-06 21:50:18,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:50:18,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:50:18,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:50:18,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:50:18,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:18,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:20,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:50:20,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:50:20,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:50:20,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:50:20,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:20,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:20,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:20,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:21,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:21,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:21,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:21,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:50:21,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:50:21,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:50:21,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:50:21,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (1/1) ... [2021-11-06 21:50:21,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:50:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:50:21,955 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-06 21:50:21,983 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-06 21:50:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:50:21,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:50:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:50:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_write_posted_mbx [2021-11-06 21:50:21,997 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_write_posted_mbx [2021-11-06 21:50:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_hw_vf [2021-11-06 21:50:21,997 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_hw_vf [2021-11-06 21:50:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:50:21,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:50:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_ack [2021-11-06 21:50:21,998 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_ack [2021-11-06 21:50:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:50:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_rar_set_vf [2021-11-06 21:50:21,998 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_rar_set_vf [2021-11-06 21:50:21,998 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_link_vf [2021-11-06 21:50:21,998 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_link_vf [2021-11-06 21:50:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:50:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:50:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_msg [2021-11-06 21:50:21,999 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_msg [2021-11-06 21:50:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:50:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_reset_hw_vf [2021-11-06 21:50:22,000 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_reset_hw_vf [2021-11-06 21:50:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:50:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:50:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:50:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:50:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~s32~0 [2021-11-06 21:50:22,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~s32~0 [2021-11-06 21:50:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:50:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2021-11-06 21:50:22,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2021-11-06 21:50:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_posted_mbx [2021-11-06 21:50:22,001 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_posted_mbx [2021-11-06 21:50:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:50:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-06 21:50:44,202 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_19_returnLabel: main_#res := 0; [2021-11-06 21:50:44,202 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:50:44,204 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_pci_pci_instance_4_switch_break: call ULTIMATE.dealloc(ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.base, ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.offset);havoc ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.base, ldv_pci_pci_instance_4_~#ldv_4_resource_pm_message~0.offset; [2021-11-06 21:50:44,204 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L14701: #t~ret1998 := main_#res; [2021-11-06 21:50:44,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:50:44,252 INFO L299 CfgBuilder]: Removed 12009 assume(true) statements. [2021-11-06 21:50:44,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:50:44 BoogieIcfgContainer [2021-11-06 21:50:44,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:50:44,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:50:44,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:50:44,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:50:44,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:50:13" (1/3) ... [2021-11-06 21:50:44,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688c3114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:50:44, skipping insertion in model container [2021-11-06 21:50:44,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:50:18" (2/3) ... [2021-11-06 21:50:44,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688c3114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:50:44, skipping insertion in model container [2021-11-06 21:50:44,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:50:44" (3/3) ... [2021-11-06 21:50:44,273 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2021-11-06 21:50:44,276 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:50:44,276 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2021-11-06 21:50:44,326 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:50:44,329 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-06 21:50:44,329 INFO L340 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2021-11-06 21:50:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 11136 states, 10859 states have (on average 1.3357583571231237) internal successors, (14505), 11010 states have internal predecessors, (14505), 115 states have call successors, (115), 10 states have call predecessors, (115), 10 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2021-11-06 21:50:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 21:50:44,431 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:44,432 INFO L513 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-06 21:50:44,432 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 470222469, now seen corresponding path program 1 times [2021-11-06 21:50:44,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:44,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348463135] [2021-11-06 21:50:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:44,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:44,906 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-06 21:50:44,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:44,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348463135] [2021-11-06 21:50:44,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348463135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:44,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:44,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:44,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929624886] [2021-11-06 21:50:44,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:44,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:44,948 INFO L87 Difference]: Start difference. First operand has 11136 states, 10859 states have (on average 1.3357583571231237) internal successors, (14505), 11010 states have internal predecessors, (14505), 115 states have call successors, (115), 10 states have call predecessors, (115), 10 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) 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-06 21:50:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:45,830 INFO L93 Difference]: Finished difference Result 33300 states and 44071 transitions. [2021-11-06 21:50:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:50:45,837 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-06 21:50:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:45,926 INFO L225 Difference]: With dead ends: 33300 [2021-11-06 21:50:45,927 INFO L226 Difference]: Without dead ends: 21479 [2021-11-06 21:50:45,967 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21479 states. [2021-11-06 21:50:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21479 to 20527. [2021-11-06 21:50:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20527 states, 20125 states have (on average 1.283031055900621) internal successors, (25821), 20278 states have internal predecessors, (25821), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20527 states to 20527 states and 26281 transitions. [2021-11-06 21:50:46,532 INFO L78 Accepts]: Start accepts. Automaton has 20527 states and 26281 transitions. Word has length 26 [2021-11-06 21:50:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:46,534 INFO L470 AbstractCegarLoop]: Abstraction has 20527 states and 26281 transitions. [2021-11-06 21:50:46,534 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-06 21:50:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20527 states and 26281 transitions. [2021-11-06 21:50:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 21:50:46,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:46,535 INFO L513 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-06 21:50:46,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:50:46,536 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:46,538 INFO L85 PathProgramCache]: Analyzing trace with hash 913418217, now seen corresponding path program 1 times [2021-11-06 21:50:46,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:46,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807561713] [2021-11-06 21:50:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:46,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:46,789 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-06 21:50:46,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:46,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807561713] [2021-11-06 21:50:46,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807561713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:46,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:46,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:46,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591891339] [2021-11-06 21:50:46,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:46,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:46,793 INFO L87 Difference]: Start difference. First operand 20527 states and 26281 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-06 21:50:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:47,231 INFO L93 Difference]: Finished difference Result 20527 states and 26281 transitions. [2021-11-06 21:50:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:47,231 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-06 21:50:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:47,310 INFO L225 Difference]: With dead ends: 20527 [2021-11-06 21:50:47,311 INFO L226 Difference]: Without dead ends: 20523 [2021-11-06 21:50:47,324 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20523 states. [2021-11-06 21:50:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20523 to 20523. [2021-11-06 21:50:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20523 states, 20123 states have (on average 1.2829597972469313) internal successors, (25817), 20274 states have internal predecessors, (25817), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 26277 transitions. [2021-11-06 21:50:47,784 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 26277 transitions. Word has length 28 [2021-11-06 21:50:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:47,785 INFO L470 AbstractCegarLoop]: Abstraction has 20523 states and 26277 transitions. [2021-11-06 21:50:47,785 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-06 21:50:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 26277 transitions. [2021-11-06 21:50:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-06 21:50:47,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:47,786 INFO L513 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-06 21:50:47,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:50:47,787 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr112ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1622770093, now seen corresponding path program 1 times [2021-11-06 21:50:47,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:47,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570682019] [2021-11-06 21:50:47,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:47,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:47,973 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-06 21:50:47,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:47,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570682019] [2021-11-06 21:50:47,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570682019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:47,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:47,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:47,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79005211] [2021-11-06 21:50:47,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:47,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:47,975 INFO L87 Difference]: Start difference. First operand 20523 states and 26277 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-06 21:50:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:48,355 INFO L93 Difference]: Finished difference Result 20523 states and 26277 transitions. [2021-11-06 21:50:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:48,355 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-06 21:50:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:48,400 INFO L225 Difference]: With dead ends: 20523 [2021-11-06 21:50:48,400 INFO L226 Difference]: Without dead ends: 20519 [2021-11-06 21:50:48,410 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20519 states. [2021-11-06 21:50:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20519 to 20519. [2021-11-06 21:50:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20519 states, 20121 states have (on average 1.2828885244272152) internal successors, (25813), 20270 states have internal predecessors, (25813), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20519 states to 20519 states and 26273 transitions. [2021-11-06 21:50:48,886 INFO L78 Accepts]: Start accepts. Automaton has 20519 states and 26273 transitions. Word has length 30 [2021-11-06 21:50:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:48,886 INFO L470 AbstractCegarLoop]: Abstraction has 20519 states and 26273 transitions. [2021-11-06 21:50:48,886 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-06 21:50:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20519 states and 26273 transitions. [2021-11-06 21:50:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 21:50:48,887 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:48,888 INFO L513 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-06 21:50:48,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:50:48,888 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr113ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 410123217, now seen corresponding path program 1 times [2021-11-06 21:50:48,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:48,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825398345] [2021-11-06 21:50:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:48,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:49,030 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-06 21:50:49,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:49,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825398345] [2021-11-06 21:50:49,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825398345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:49,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:49,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:49,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197256493] [2021-11-06 21:50:49,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:49,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:49,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:49,032 INFO L87 Difference]: Start difference. First operand 20519 states and 26273 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-06 21:50:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:49,387 INFO L93 Difference]: Finished difference Result 20519 states and 26273 transitions. [2021-11-06 21:50:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:49,387 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-06 21:50:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:49,432 INFO L225 Difference]: With dead ends: 20519 [2021-11-06 21:50:49,433 INFO L226 Difference]: Without dead ends: 20515 [2021-11-06 21:50:49,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20515 states. [2021-11-06 21:50:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20515 to 20515. [2021-11-06 21:50:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20515 states, 20119 states have (on average 1.2828172374372484) internal successors, (25809), 20266 states have internal predecessors, (25809), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20515 states to 20515 states and 26269 transitions. [2021-11-06 21:50:49,909 INFO L78 Accepts]: Start accepts. Automaton has 20515 states and 26269 transitions. Word has length 32 [2021-11-06 21:50:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:49,909 INFO L470 AbstractCegarLoop]: Abstraction has 20515 states and 26269 transitions. [2021-11-06 21:50:49,909 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-06 21:50:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20515 states and 26269 transitions. [2021-11-06 21:50:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-06 21:50:49,912 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:49,912 INFO L513 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-06 21:50:49,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:50:49,912 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1007387051, now seen corresponding path program 1 times [2021-11-06 21:50:49,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:49,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336235813] [2021-11-06 21:50:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:49,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:50,111 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-06 21:50:50,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:50,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336235813] [2021-11-06 21:50:50,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336235813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:50,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:50,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:50,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862720432] [2021-11-06 21:50:50,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:50,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:50,116 INFO L87 Difference]: Start difference. First operand 20515 states and 26269 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-06 21:50:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:50,472 INFO L93 Difference]: Finished difference Result 20515 states and 26269 transitions. [2021-11-06 21:50:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:50,473 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-06 21:50:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:50,519 INFO L225 Difference]: With dead ends: 20515 [2021-11-06 21:50:50,519 INFO L226 Difference]: Without dead ends: 20511 [2021-11-06 21:50:50,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20511 states. [2021-11-06 21:50:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20511 to 20511. [2021-11-06 21:50:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20511 states, 20117 states have (on average 1.2827459362728042) internal successors, (25805), 20262 states have internal predecessors, (25805), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20511 states to 20511 states and 26265 transitions. [2021-11-06 21:50:51,079 INFO L78 Accepts]: Start accepts. Automaton has 20511 states and 26265 transitions. Word has length 34 [2021-11-06 21:50:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:51,080 INFO L470 AbstractCegarLoop]: Abstraction has 20511 states and 26265 transitions. [2021-11-06 21:50:51,080 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-06 21:50:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20511 states and 26265 transitions. [2021-11-06 21:50:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 21:50:51,083 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:51,084 INFO L513 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-06 21:50:51,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:50:51,084 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1730121415, now seen corresponding path program 1 times [2021-11-06 21:50:51,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:51,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178449483] [2021-11-06 21:50:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:51,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:51,240 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-06 21:50:51,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:51,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178449483] [2021-11-06 21:50:51,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178449483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:51,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:51,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:51,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530387714] [2021-11-06 21:50:51,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:51,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:51,242 INFO L87 Difference]: Start difference. First operand 20511 states and 26265 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-06 21:50:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:51,546 INFO L93 Difference]: Finished difference Result 20511 states and 26265 transitions. [2021-11-06 21:50:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:51,546 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-06 21:50:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:51,592 INFO L225 Difference]: With dead ends: 20511 [2021-11-06 21:50:51,592 INFO L226 Difference]: Without dead ends: 20507 [2021-11-06 21:50:51,603 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20507 states. [2021-11-06 21:50:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20507 to 20507. [2021-11-06 21:50:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20507 states, 20115 states have (on average 1.2826746209296545) internal successors, (25801), 20258 states have internal predecessors, (25801), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20507 states to 20507 states and 26261 transitions. [2021-11-06 21:50:52,231 INFO L78 Accepts]: Start accepts. Automaton has 20507 states and 26261 transitions. Word has length 36 [2021-11-06 21:50:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:52,231 INFO L470 AbstractCegarLoop]: Abstraction has 20507 states and 26261 transitions. [2021-11-06 21:50:52,231 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-06 21:50:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20507 states and 26261 transitions. [2021-11-06 21:50:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 21:50:52,233 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:52,233 INFO L513 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-06 21:50:52,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:50:52,234 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:52,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash -493142915, now seen corresponding path program 1 times [2021-11-06 21:50:52,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:52,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191051869] [2021-11-06 21:50:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:52,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:52,395 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-06 21:50:52,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:52,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191051869] [2021-11-06 21:50:52,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191051869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:52,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:52,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:52,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408258351] [2021-11-06 21:50:52,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:52,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:52,397 INFO L87 Difference]: Start difference. First operand 20507 states and 26261 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-06 21:50:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:52,833 INFO L93 Difference]: Finished difference Result 20507 states and 26261 transitions. [2021-11-06 21:50:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:52,834 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-06 21:50:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:52,879 INFO L225 Difference]: With dead ends: 20507 [2021-11-06 21:50:52,880 INFO L226 Difference]: Without dead ends: 20503 [2021-11-06 21:50:52,890 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20503 states. [2021-11-06 21:50:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20503 to 20503. [2021-11-06 21:50:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20503 states, 20113 states have (on average 1.2826032914035699) internal successors, (25797), 20254 states have internal predecessors, (25797), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20503 states to 20503 states and 26257 transitions. [2021-11-06 21:50:53,481 INFO L78 Accepts]: Start accepts. Automaton has 20503 states and 26257 transitions. Word has length 38 [2021-11-06 21:50:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:53,481 INFO L470 AbstractCegarLoop]: Abstraction has 20503 states and 26257 transitions. [2021-11-06 21:50:53,482 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-06 21:50:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20503 states and 26257 transitions. [2021-11-06 21:50:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 21:50:53,483 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:53,483 INFO L513 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-06 21:50:53,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:50:53,484 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1462745055, now seen corresponding path program 1 times [2021-11-06 21:50:53,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:53,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33481927] [2021-11-06 21:50:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:53,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:53,646 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-06 21:50:53,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:53,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33481927] [2021-11-06 21:50:53,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33481927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:53,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:53,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:53,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178714376] [2021-11-06 21:50:53,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:53,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:53,649 INFO L87 Difference]: Start difference. First operand 20503 states and 26257 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-06 21:50:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:53,997 INFO L93 Difference]: Finished difference Result 20503 states and 26257 transitions. [2021-11-06 21:50:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:53,998 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-06 21:50:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:54,042 INFO L225 Difference]: With dead ends: 20503 [2021-11-06 21:50:54,044 INFO L226 Difference]: Without dead ends: 20499 [2021-11-06 21:50:54,055 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20499 states. [2021-11-06 21:50:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20499 to 20499. [2021-11-06 21:50:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20499 states, 20111 states have (on average 1.2825319476903188) internal successors, (25793), 20250 states have internal predecessors, (25793), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 228 states have call predecessors, (230), 230 states have call successors, (230) [2021-11-06 21:50:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20499 states to 20499 states and 26253 transitions. [2021-11-06 21:50:54,680 INFO L78 Accepts]: Start accepts. Automaton has 20499 states and 26253 transitions. Word has length 40 [2021-11-06 21:50:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:54,682 INFO L470 AbstractCegarLoop]: Abstraction has 20499 states and 26253 transitions. [2021-11-06 21:50:54,682 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-06 21:50:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 20499 states and 26253 transitions. [2021-11-06 21:50:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:50:54,683 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:54,683 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:50:54,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:50:54,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:54,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -871289391, now seen corresponding path program 1 times [2021-11-06 21:50:54,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:54,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420521562] [2021-11-06 21:50:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:54,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:54,828 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-06 21:50:54,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:54,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420521562] [2021-11-06 21:50:54,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420521562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:54,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:54,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:54,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345238829] [2021-11-06 21:50:54,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:50:54,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:50:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:50:54,830 INFO L87 Difference]: Start difference. First operand 20499 states and 26253 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:55,574 INFO L93 Difference]: Finished difference Result 48423 states and 62092 transitions. [2021-11-06 21:50:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:50:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 21:50:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:55,647 INFO L225 Difference]: With dead ends: 48423 [2021-11-06 21:50:55,647 INFO L226 Difference]: Without dead ends: 27955 [2021-11-06 21:50:55,692 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:50:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27955 states. [2021-11-06 21:50:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27955 to 27867. [2021-11-06 21:50:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27867 states, 27355 states have (on average 1.285212940961433) internal successors, (35157), 27494 states have internal predecessors, (35157), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:50:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27867 states to 27867 states and 35825 transitions. [2021-11-06 21:50:56,715 INFO L78 Accepts]: Start accepts. Automaton has 27867 states and 35825 transitions. Word has length 41 [2021-11-06 21:50:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:56,715 INFO L470 AbstractCegarLoop]: Abstraction has 27867 states and 35825 transitions. [2021-11-06 21:50:56,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:50:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27867 states and 35825 transitions. [2021-11-06 21:50:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 21:50:56,716 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:56,716 INFO L513 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-06 21:50:56,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:50:56,716 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1242499004, now seen corresponding path program 1 times [2021-11-06 21:50:56,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:56,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739478241] [2021-11-06 21:50:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:56,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:56,875 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-06 21:50:56,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:56,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739478241] [2021-11-06 21:50:56,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739478241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:56,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:56,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:56,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046637592] [2021-11-06 21:50:56,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:56,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:56,877 INFO L87 Difference]: Start difference. First operand 27867 states and 35825 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-06 21:50:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:57,556 INFO L93 Difference]: Finished difference Result 27867 states and 35825 transitions. [2021-11-06 21:50:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:57,556 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-06 21:50:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:57,620 INFO L225 Difference]: With dead ends: 27867 [2021-11-06 21:50:57,621 INFO L226 Difference]: Without dead ends: 27863 [2021-11-06 21:50:57,632 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27863 states. [2021-11-06 21:50:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27863 to 27863. [2021-11-06 21:50:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27863 states, 27353 states have (on average 1.2851606770738127) internal successors, (35153), 27490 states have internal predecessors, (35153), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:50:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27863 states to 27863 states and 35821 transitions. [2021-11-06 21:50:58,523 INFO L78 Accepts]: Start accepts. Automaton has 27863 states and 35821 transitions. Word has length 42 [2021-11-06 21:50:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:50:58,524 INFO L470 AbstractCegarLoop]: Abstraction has 27863 states and 35821 transitions. [2021-11-06 21:50:58,524 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-06 21:50:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 27863 states and 35821 transitions. [2021-11-06 21:50:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 21:50:58,524 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:50:58,525 INFO L513 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-06 21:50:58,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:50:58,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:50:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:50:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -39440184, now seen corresponding path program 1 times [2021-11-06 21:50:58,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:50:58,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290150835] [2021-11-06 21:50:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:50:58,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:50:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:50:58,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-06 21:50:58,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:50:58,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290150835] [2021-11-06 21:50:58,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290150835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:50:58,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:50:58,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:50:58,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324225394] [2021-11-06 21:50:58,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:50:58,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:50:58,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:50:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:50:58,671 INFO L87 Difference]: Start difference. First operand 27863 states and 35821 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-06 21:50:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:50:59,209 INFO L93 Difference]: Finished difference Result 27863 states and 35821 transitions. [2021-11-06 21:50:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:50:59,210 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-06 21:50:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:50:59,269 INFO L225 Difference]: With dead ends: 27863 [2021-11-06 21:50:59,269 INFO L226 Difference]: Without dead ends: 27859 [2021-11-06 21:50:59,285 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:50:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27859 states. [2021-11-06 21:51:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27859 to 27859. [2021-11-06 21:51:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27859 states, 27351 states have (on average 1.2851084055427588) internal successors, (35149), 27486 states have internal predecessors, (35149), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:51:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27859 states to 27859 states and 35817 transitions. [2021-11-06 21:51:00,174 INFO L78 Accepts]: Start accepts. Automaton has 27859 states and 35817 transitions. Word has length 44 [2021-11-06 21:51:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:00,174 INFO L470 AbstractCegarLoop]: Abstraction has 27859 states and 35817 transitions. [2021-11-06 21:51:00,174 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-06 21:51:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27859 states and 35817 transitions. [2021-11-06 21:51:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 21:51:00,175 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:00,175 INFO L513 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-06 21:51:00,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:51:00,175 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:51:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1753042201, now seen corresponding path program 1 times [2021-11-06 21:51:00,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:00,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213048821] [2021-11-06 21:51:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:00,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:00,300 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-06 21:51:00,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:00,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213048821] [2021-11-06 21:51:00,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213048821] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:00,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:00,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:51:00,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88774008] [2021-11-06 21:51:00,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:51:00,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:51:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:00,302 INFO L87 Difference]: Start difference. First operand 27859 states and 35817 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-06 21:51:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:02,077 INFO L93 Difference]: Finished difference Result 55777 states and 71649 transitions. [2021-11-06 21:51:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:02,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-06 21:51:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:02,134 INFO L225 Difference]: With dead ends: 55777 [2021-11-06 21:51:02,134 INFO L226 Difference]: Without dead ends: 27949 [2021-11-06 21:51:02,379 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:51:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27949 states. [2021-11-06 21:51:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27949 to 27855. [2021-11-06 21:51:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27855 states, 27348 states have (on average 1.2849934181658622) internal successors, (35142), 27482 states have internal predecessors, (35142), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:51:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27855 states to 27855 states and 35810 transitions. [2021-11-06 21:51:03,110 INFO L78 Accepts]: Start accepts. Automaton has 27855 states and 35810 transitions. Word has length 44 [2021-11-06 21:51:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:03,111 INFO L470 AbstractCegarLoop]: Abstraction has 27855 states and 35810 transitions. [2021-11-06 21:51:03,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-06 21:51:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states and 35810 transitions. [2021-11-06 21:51:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 21:51:03,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:03,111 INFO L513 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-06 21:51:03,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:51:03,112 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:51:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash 753883564, now seen corresponding path program 1 times [2021-11-06 21:51:03,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:03,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160461411] [2021-11-06 21:51:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:03,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:03,234 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-06 21:51:03,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:03,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160461411] [2021-11-06 21:51:03,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160461411] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:03,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:03,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:03,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487079104] [2021-11-06 21:51:03,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:03,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:03,236 INFO L87 Difference]: Start difference. First operand 27855 states and 35810 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-06 21:51:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:04,113 INFO L93 Difference]: Finished difference Result 27855 states and 35810 transitions. [2021-11-06 21:51:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:04,114 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-06 21:51:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:04,154 INFO L225 Difference]: With dead ends: 27855 [2021-11-06 21:51:04,154 INFO L226 Difference]: Without dead ends: 27851 [2021-11-06 21:51:04,162 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27851 states. [2021-11-06 21:51:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27851 to 27851. [2021-11-06 21:51:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27851 states, 27346 states have (on average 1.2849411248445841) internal successors, (35138), 27478 states have internal predecessors, (35138), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:51:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27851 states to 27851 states and 35806 transitions. [2021-11-06 21:51:05,088 INFO L78 Accepts]: Start accepts. Automaton has 27851 states and 35806 transitions. Word has length 46 [2021-11-06 21:51:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:05,088 INFO L470 AbstractCegarLoop]: Abstraction has 27851 states and 35806 transitions. [2021-11-06 21:51:05,088 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-06 21:51:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 27851 states and 35806 transitions. [2021-11-06 21:51:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:51:05,089 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:05,089 INFO L513 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-06 21:51:05,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:51:05,089 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:51:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1366172944, now seen corresponding path program 1 times [2021-11-06 21:51:05,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:05,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439161842] [2021-11-06 21:51:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:05,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:05,235 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-06 21:51:05,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:05,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439161842] [2021-11-06 21:51:05,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439161842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:05,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:05,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:05,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543807189] [2021-11-06 21:51:05,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:05,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:05,237 INFO L87 Difference]: Start difference. First operand 27851 states and 35806 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-06 21:51:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:06,191 INFO L93 Difference]: Finished difference Result 27851 states and 35806 transitions. [2021-11-06 21:51:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:06,201 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-06 21:51:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:06,249 INFO L225 Difference]: With dead ends: 27851 [2021-11-06 21:51:06,249 INFO L226 Difference]: Without dead ends: 27847 [2021-11-06 21:51:06,261 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27847 states. [2021-11-06 21:51:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27847 to 27847. [2021-11-06 21:51:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27847 states, 27344 states have (on average 1.2848888238736103) internal successors, (35134), 27474 states have internal predecessors, (35134), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:51:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27847 states to 27847 states and 35802 transitions. [2021-11-06 21:51:07,223 INFO L78 Accepts]: Start accepts. Automaton has 27847 states and 35802 transitions. Word has length 48 [2021-11-06 21:51:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:07,223 INFO L470 AbstractCegarLoop]: Abstraction has 27847 states and 35802 transitions. [2021-11-06 21:51:07,223 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-06 21:51:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27847 states and 35802 transitions. [2021-11-06 21:51:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 21:51:07,224 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:07,224 INFO L513 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-06 21:51:07,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:51:07,224 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr122ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:51:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1368988820, now seen corresponding path program 1 times [2021-11-06 21:51:07,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:07,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400350148] [2021-11-06 21:51:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:07,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:07,391 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-06 21:51:07,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:07,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400350148] [2021-11-06 21:51:07,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400350148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:07,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:07,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:07,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644417897] [2021-11-06 21:51:07,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:07,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:07,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:07,393 INFO L87 Difference]: Start difference. First operand 27847 states and 35802 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-06 21:51:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:08,193 INFO L93 Difference]: Finished difference Result 27847 states and 35802 transitions. [2021-11-06 21:51:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:08,194 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-06 21:51:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:08,246 INFO L225 Difference]: With dead ends: 27847 [2021-11-06 21:51:08,246 INFO L226 Difference]: Without dead ends: 27843 [2021-11-06 21:51:08,262 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27843 states. [2021-11-06 21:51:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27843 to 27843. [2021-11-06 21:51:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27843 states, 27342 states have (on average 1.2848365152512617) internal successors, (35130), 27470 states have internal predecessors, (35130), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:51:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27843 states to 27843 states and 35798 transitions. [2021-11-06 21:51:09,481 INFO L78 Accepts]: Start accepts. Automaton has 27843 states and 35798 transitions. Word has length 50 [2021-11-06 21:51:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:09,481 INFO L470 AbstractCegarLoop]: Abstraction has 27843 states and 35798 transitions. [2021-11-06 21:51:09,481 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-06 21:51:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27843 states and 35798 transitions. [2021-11-06 21:51:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 21:51:09,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:09,482 INFO L513 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-06 21:51:09,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:51:09,482 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr123ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:51:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1339459224, now seen corresponding path program 1 times [2021-11-06 21:51:09,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:09,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248144818] [2021-11-06 21:51:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:09,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:09,603 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-06 21:51:09,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:09,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248144818] [2021-11-06 21:51:09,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248144818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:09,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:09,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:09,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585843301] [2021-11-06 21:51:09,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:09,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:09,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:09,605 INFO L87 Difference]: Start difference. First operand 27843 states and 35798 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-06 21:51:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:10,452 INFO L93 Difference]: Finished difference Result 27843 states and 35798 transitions. [2021-11-06 21:51:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:10,453 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-06 21:51:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:10,513 INFO L225 Difference]: With dead ends: 27843 [2021-11-06 21:51:10,513 INFO L226 Difference]: Without dead ends: 27839 [2021-11-06 21:51:10,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27839 states. [2021-11-06 21:51:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27839 to 27839. [2021-11-06 21:51:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27839 states, 27340 states have (on average 1.2847841989758595) internal successors, (35126), 27466 states have internal predecessors, (35126), 334 states have call successors, (334), 40 states have call predecessors, (334), 40 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-06 21:51:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27839 states to 27839 states and 35794 transitions. [2021-11-06 21:51:11,565 INFO L78 Accepts]: Start accepts. Automaton has 27839 states and 35794 transitions. Word has length 52 [2021-11-06 21:51:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:11,565 INFO L470 AbstractCegarLoop]: Abstraction has 27839 states and 35794 transitions. [2021-11-06 21:51:11,565 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-06 21:51:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 27839 states and 35794 transitions. [2021-11-06 21:51:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:51:11,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:11,566 INFO L513 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-06 21:51:11,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:51:11,566 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr124ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 149 more)] === [2021-11-06 21:51:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1268678404, now seen corresponding path program 1 times [2021-11-06 21:51:11,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:11,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812641226] [2021-11-06 21:51:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:11,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:11,706 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-06 21:51:11,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:11,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812641226] [2021-11-06 21:51:11,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812641226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:11,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:11,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:11,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790366311] [2021-11-06 21:51:11,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:11,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:11,708 INFO L87 Difference]: Start difference. First operand 27839 states and 35794 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-06 21:51:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:12,695 INFO L93 Difference]: Finished difference Result 27839 states and 35794 transitions. [2021-11-06 21:51:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:12,695 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-06 21:51:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:12,735 INFO L225 Difference]: With dead ends: 27839 [2021-11-06 21:51:12,735 INFO L226 Difference]: Without dead ends: 27835 [2021-11-06 21:51:12,741 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27835 states.