./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.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 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 20:45:07,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 20:45:07,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 20:45:07,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 20:45:07,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 20:45:07,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 20:45:07,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 20:45:07,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 20:45:07,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 20:45:07,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 20:45:07,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 20:45:07,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 20:45:07,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 20:45:07,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 20:45:07,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 20:45:07,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 20:45:07,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 20:45:07,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 20:45:07,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 20:45:07,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 20:45:07,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 20:45:07,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 20:45:07,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 20:45:07,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 20:45:07,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 20:45:07,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 20:45:07,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 20:45:07,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 20:45:07,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 20:45:07,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 20:45:07,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 20:45:07,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 20:45:07,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 20:45:07,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 20:45:07,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 20:45:07,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 20:45:07,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 20:45:07,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 20:45:07,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 20:45:07,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 20:45:07,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 20:45:07,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 20:45:07,556 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 20:45:07,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 20:45:07,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 20:45:07,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 20:45:07,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 20:45:07,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 20:45:07,559 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 20:45:07,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 20:45:07,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 20:45:07,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 20:45:07,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 20:45:07,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 20:45:07,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 20:45:07,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 20:45:07,560 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 20:45:07,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 20:45:07,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 20:45:07,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 20:45:07,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 20:45:07,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 20:45:07,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 20:45:07,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 20:45:07,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 20:45:07,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 20:45:07,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 20:45:07,562 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 20:45:07,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 20:45:07,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 20:45:07,562 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 20:45:07,562 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 -> 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 [2021-11-07 20:45:07,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 20:45:07,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 20:45:07,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 20:45:07,757 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 20:45:07,760 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 20:45:07,761 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---net--rose--rose.ko.cil.i [2021-11-07 20:45:07,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b8f3767/674de602bfbc46a9a36605b627d46361/FLAG6c02c4f27 [2021-11-07 20:45:08,494 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 20:45:08,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-07 20:45:08,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b8f3767/674de602bfbc46a9a36605b627d46361/FLAG6c02c4f27 [2021-11-07 20:45:09,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b8f3767/674de602bfbc46a9a36605b627d46361 [2021-11-07 20:45:09,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 20:45:09,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 20:45:09,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 20:45:09,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 20:45:09,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 20:45:09,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:45:09" (1/1) ... [2021-11-07 20:45:09,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f678a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:09, skipping insertion in model container [2021-11-07 20:45:09,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:45:09" (1/1) ... [2021-11-07 20:45:09,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 20:45:09,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 20:45:15,547 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2021-11-07 20:45:15,549 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2021-11-07 20:45:15,550 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2021-11-07 20:45:15,550 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2021-11-07 20:45:15,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2021-11-07 20:45:15,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2021-11-07 20:45:15,551 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2021-11-07 20:45:15,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2021-11-07 20:45:15,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2021-11-07 20:45:15,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2021-11-07 20:45:15,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-11-07 20:45:15,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-11-07 20:45:15,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-11-07 20:45:15,553 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-11-07 20:45:15,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2021-11-07 20:45:15,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2021-11-07 20:45:15,554 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2021-11-07 20:45:15,555 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2021-11-07 20:45:15,555 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2021-11-07 20:45:15,555 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2021-11-07 20:45:15,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2021-11-07 20:45:15,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2021-11-07 20:45:15,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-11-07 20:45:15,556 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-11-07 20:45:15,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-11-07 20:45:15,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-11-07 20:45:15,557 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-11-07 20:45:15,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-11-07 20:45:15,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-11-07 20:45:15,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-11-07 20:45:15,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-11-07 20:45:15,559 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-11-07 20:45:15,563 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-11-07 20:45:15,563 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-11-07 20:45:15,563 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-11-07 20:45:15,564 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-11-07 20:45:15,564 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-11-07 20:45:15,564 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-11-07 20:45:15,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-11-07 20:45:15,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-11-07 20:45:15,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-11-07 20:45:15,565 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-11-07 20:45:15,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-11-07 20:45:15,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2021-11-07 20:45:15,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2021-11-07 20:45:15,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2021-11-07 20:45:15,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2021-11-07 20:45:15,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2021-11-07 20:45:15,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2021-11-07 20:45:15,568 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2021-11-07 20:45:15,568 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2021-11-07 20:45:15,568 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2021-11-07 20:45:15,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2021-11-07 20:45:15,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2021-11-07 20:45:15,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2021-11-07 20:45:15,569 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2021-11-07 20:45:15,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2021-11-07 20:45:15,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2021-11-07 20:45:15,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2021-11-07 20:45:15,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2021-11-07 20:45:15,571 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2021-11-07 20:45:15,571 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2021-11-07 20:45:15,571 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2021-11-07 20:45:15,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2021-11-07 20:45:15,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2021-11-07 20:45:15,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2021-11-07 20:45:15,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-11-07 20:45:15,573 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-11-07 20:45:15,573 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-11-07 20:45:15,573 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2021-11-07 20:45:15,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2021-11-07 20:45:15,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2021-11-07 20:45:15,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2021-11-07 20:45:15,574 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-11-07 20:45:15,575 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2021-11-07 20:45:15,575 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2021-11-07 20:45:15,575 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2021-11-07 20:45:15,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2021-11-07 20:45:15,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2021-11-07 20:45:15,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2021-11-07 20:45:15,576 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2021-11-07 20:45:15,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2021-11-07 20:45:15,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2021-11-07 20:45:15,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2021-11-07 20:45:15,577 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2021-11-07 20:45:15,578 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2021-11-07 20:45:15,578 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2021-11-07 20:45:15,578 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2021-11-07 20:45:15,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 20:45:15,635 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 20:45:16,138 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2021-11-07 20:45:16,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2021-11-07 20:45:16,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2021-11-07 20:45:16,144 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2021-11-07 20:45:16,144 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2021-11-07 20:45:16,144 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2021-11-07 20:45:16,145 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2021-11-07 20:45:16,146 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2021-11-07 20:45:16,146 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2021-11-07 20:45:16,147 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2021-11-07 20:45:16,147 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-11-07 20:45:16,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-11-07 20:45:16,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-11-07 20:45:16,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-11-07 20:45:16,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2021-11-07 20:45:16,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2021-11-07 20:45:16,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2021-11-07 20:45:16,150 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2021-11-07 20:45:16,152 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2021-11-07 20:45:16,152 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2021-11-07 20:45:16,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2021-11-07 20:45:16,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2021-11-07 20:45:16,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-11-07 20:45:16,154 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-11-07 20:45:16,154 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-11-07 20:45:16,154 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-11-07 20:45:16,155 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-11-07 20:45:16,155 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-11-07 20:45:16,155 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-11-07 20:45:16,156 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-11-07 20:45:16,156 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-11-07 20:45:16,156 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-11-07 20:45:16,156 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-11-07 20:45:16,157 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-11-07 20:45:16,157 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-11-07 20:45:16,157 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-11-07 20:45:16,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-11-07 20:45:16,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-11-07 20:45:16,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-11-07 20:45:16,159 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-11-07 20:45:16,159 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-11-07 20:45:16,160 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-11-07 20:45:16,161 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-11-07 20:45:16,161 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2021-11-07 20:45:16,161 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2021-11-07 20:45:16,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2021-11-07 20:45:16,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2021-11-07 20:45:16,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2021-11-07 20:45:16,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2021-11-07 20:45:16,163 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2021-11-07 20:45:16,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2021-11-07 20:45:16,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2021-11-07 20:45:16,165 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2021-11-07 20:45:16,165 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[688776,688789] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[688935,688948] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689081,689094] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689224,689237] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689368,689381] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689511,689524] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689655,689668] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689796,689809] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[689934,689947] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[690092,690105] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[690251,690264] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[690407,690420] [2021-11-07 20:45:16,175 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-11-07 20:45:16,175 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-11-07 20:45:16,176 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-11-07 20:45:16,176 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2021-11-07 20:45:16,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2021-11-07 20:45:16,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2021-11-07 20:45:16,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2021-11-07 20:45:16,177 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[691762,691775] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[691909,691922] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[692060,692073] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[692211,692224] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[692359,692372] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[692525,692538] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[692694,692707] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[692861,692874] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[693029,693042] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[693179,693192] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[693326,693339] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[693487,693500] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[693657,693670] [2021-11-07 20:45:16,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---net--rose--rose.ko.cil.i[693819,693832] [2021-11-07 20:45:16,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 20:45:16,433 INFO L208 MainTranslator]: Completed translation [2021-11-07 20:45:16,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16 WrapperNode [2021-11-07 20:45:16,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 20:45:16,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 20:45:16,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 20:45:16,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 20:45:16,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:16,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:19,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 20:45:19,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 20:45:19,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 20:45:19,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 20:45:19,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:19,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:20,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:20,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:22,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:22,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:23,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:23,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 20:45:23,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 20:45:23,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 20:45:23,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 20:45:23,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (1/1) ... [2021-11-07 20:45:23,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 20:45:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 20:45:24,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 20:45:24,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 20:45:24,038 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-07 20:45:24,039 INFO L130 BoogieDeclarations]: Found specification of procedure sock_wfree [2021-11-07 20:45:24,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 20:45:24,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 20:45:24,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 20:45:24,039 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-07 20:45:24,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 20:45:24,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-07 20:45:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-07 20:45:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-07 20:45:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 20:45:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 20:49:42,730 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-07 20:49:42,734 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L11799: #t~ret2561 := main_#res; [2021-11-07 20:49:42,734 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_27_returnLabel: main_#res := 0; [2021-11-07 20:49:42,789 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 20:49:42,789 INFO L299 CfgBuilder]: Removed 23684 assume(true) statements. [2021-11-07 20:49:42,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:49:42 BoogieIcfgContainer [2021-11-07 20:49:42,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 20:49:42,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 20:49:42,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 20:49:42,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 20:49:42,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:45:09" (1/3) ... [2021-11-07 20:49:42,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a139deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:49:42, skipping insertion in model container [2021-11-07 20:49:42,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:16" (2/3) ... [2021-11-07 20:49:42,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a139deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:49:42, skipping insertion in model container [2021-11-07 20:49:42,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:49:42" (3/3) ... [2021-11-07 20:49:42,814 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-07 20:49:42,817 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 20:49:42,818 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 539 error locations. [2021-11-07 20:49:42,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 20:49:42,900 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 20:49:42,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 539 error locations. [2021-11-07 20:49:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 23274 states, 22735 states have (on average 1.391818781614251) internal successors, (31643), 23273 states have internal predecessors, (31643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 20:49:43,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:49:43,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:49:43,131 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:49:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:49:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1421350192, now seen corresponding path program 1 times [2021-11-07 20:49:43,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:49:43,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087199500] [2021-11-07 20:49:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:49:43,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:49:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:49:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:49:43,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:49:43,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087199500] [2021-11-07 20:49:43,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087199500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:49:43,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:49:43,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:49:43,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470977692] [2021-11-07 20:49:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:49:43,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 20:49:43,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:49:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 20:49:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:49:44,012 INFO L87 Difference]: Start difference. First operand has 23274 states, 22735 states have (on average 1.391818781614251) internal successors, (31643), 23273 states have internal predecessors, (31643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:49:50,315 INFO L93 Difference]: Finished difference Result 54177 states and 73821 transitions. [2021-11-07 20:49:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 20:49:50,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-07 20:49:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:49:50,440 INFO L225 Difference]: With dead ends: 54177 [2021-11-07 20:49:50,440 INFO L226 Difference]: Without dead ends: 28622 [2021-11-07 20:49:50,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 186.96ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 20:49:50,499 INFO L933 BasicCegarLoop]: 40847 mSDtfsCounter, 71356 mSDsluCounter, 44219 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4721.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71356 SdHoareTripleChecker+Valid, 85066 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 146.12ms SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5167.28ms IncrementalHoareTripleChecker+Time [2021-11-07 20:49:50,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71356 Valid, 85066 Invalid, 1569 Unknown, 0 Unchecked, 146.12ms Time], IncrementalHoareTripleChecker [481 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 5167.28ms Time] [2021-11-07 20:49:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28622 states. [2021-11-07 20:49:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28622 to 21517. [2021-11-07 20:49:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21517 states, 20978 states have (on average 1.3083706740394698) internal successors, (27447), 21516 states have internal predecessors, (27447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21517 states to 21517 states and 27447 transitions. [2021-11-07 20:49:51,195 INFO L78 Accepts]: Start accepts. Automaton has 21517 states and 27447 transitions. Word has length 12 [2021-11-07 20:49:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:49:51,196 INFO L470 AbstractCegarLoop]: Abstraction has 21517 states and 27447 transitions. [2021-11-07 20:49:51,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21517 states and 27447 transitions. [2021-11-07 20:49:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 20:49:51,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:49:51,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:49:51,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 20:49:51,200 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:49:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:49:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1421290610, now seen corresponding path program 1 times [2021-11-07 20:49:51,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:49:51,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982645040] [2021-11-07 20:49:51,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:49:51,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:49:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:49:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:49:51,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:49:51,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982645040] [2021-11-07 20:49:51,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982645040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:49:51,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:49:51,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 20:49:51,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255854022] [2021-11-07 20:49:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:49:51,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:49:51,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:49:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:49:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:49:51,468 INFO L87 Difference]: Start difference. First operand 21517 states and 27447 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:49:57,377 INFO L93 Difference]: Finished difference Result 34483 states and 44247 transitions. [2021-11-07 20:49:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 20:49:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-07 20:49:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:49:57,452 INFO L225 Difference]: With dead ends: 34483 [2021-11-07 20:49:57,452 INFO L226 Difference]: Without dead ends: 34101 [2021-11-07 20:49:57,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.01ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:49:57,471 INFO L933 BasicCegarLoop]: 40365 mSDtfsCounter, 56089 mSDsluCounter, 26155 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4460.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 56089 SdHoareTripleChecker+Valid, 66520 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 81.19ms SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4872.02ms IncrementalHoareTripleChecker+Time [2021-11-07 20:49:57,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56089 Valid, 66520 Invalid, 1805 Unknown, 0 Unchecked, 81.19ms Time], IncrementalHoareTripleChecker [766 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 4872.02ms Time] [2021-11-07 20:49:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34101 states. [2021-11-07 20:49:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34101 to 21383. [2021-11-07 20:49:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21383 states, 20973 states have (on average 1.3022934248796072) internal successors, (27313), 21382 states have internal predecessors, (27313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21383 states to 21383 states and 27313 transitions. [2021-11-07 20:49:58,097 INFO L78 Accepts]: Start accepts. Automaton has 21383 states and 27313 transitions. Word has length 12 [2021-11-07 20:49:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:49:58,097 INFO L470 AbstractCegarLoop]: Abstraction has 21383 states and 27313 transitions. [2021-11-07 20:49:58,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 21383 states and 27313 transitions. [2021-11-07 20:49:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 20:49:58,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:49:58,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:49:58,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 20:49:58,098 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:49:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:49:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1877009153, now seen corresponding path program 1 times [2021-11-07 20:49:58,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:49:58,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667370219] [2021-11-07 20:49:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:49:58,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:49:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:49:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:49:58,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:49:58,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667370219] [2021-11-07 20:49:58,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667370219] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:49:58,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:49:58,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 20:49:58,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794846653] [2021-11-07 20:49:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:49:58,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 20:49:58,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:49:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 20:49:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:49:58,300 INFO L87 Difference]: Start difference. First operand 21383 states and 27313 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:49:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:49:59,927 INFO L93 Difference]: Finished difference Result 42180 states and 54037 transitions. [2021-11-07 20:49:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 20:49:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-07 20:49:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:49:59,963 INFO L225 Difference]: With dead ends: 42180 [2021-11-07 20:49:59,964 INFO L226 Difference]: Without dead ends: 20810 [2021-11-07 20:49:59,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.88ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 20:49:59,989 INFO L933 BasicCegarLoop]: 26234 mSDtfsCounter, 26413 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 816.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26413 SdHoareTripleChecker+Valid, 26234 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.60ms SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 892.40ms IncrementalHoareTripleChecker+Time [2021-11-07 20:49:59,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26413 Valid, 26234 Invalid, 381 Unknown, 0 Unchecked, 30.60ms Time], IncrementalHoareTripleChecker [190 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 892.40ms Time] [2021-11-07 20:50:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20810 states. [2021-11-07 20:50:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20810 to 20810. [2021-11-07 20:50:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20810 states, 20591 states have (on average 1.289349715895294) internal successors, (26549), 20809 states have internal predecessors, (26549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20810 states to 20810 states and 26549 transitions. [2021-11-07 20:50:00,617 INFO L78 Accepts]: Start accepts. Automaton has 20810 states and 26549 transitions. Word has length 15 [2021-11-07 20:50:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:00,617 INFO L470 AbstractCegarLoop]: Abstraction has 20810 states and 26549 transitions. [2021-11-07 20:50:00,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 20810 states and 26549 transitions. [2021-11-07 20:50:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 20:50:00,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:00,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:00,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 20:50:00,618 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1646240705, now seen corresponding path program 1 times [2021-11-07 20:50:00,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:00,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093596786] [2021-11-07 20:50:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:00,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:00,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:00,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093596786] [2021-11-07 20:50:00,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093596786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:00,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:00,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:00,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036195913] [2021-11-07 20:50:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:00,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:00,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:00,855 INFO L87 Difference]: Start difference. First operand 20810 states and 26549 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:01,407 INFO L93 Difference]: Finished difference Result 20810 states and 26549 transitions. [2021-11-07 20:50:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-11-07 20:50:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:01,447 INFO L225 Difference]: With dead ends: 20810 [2021-11-07 20:50:01,447 INFO L226 Difference]: Without dead ends: 20806 [2021-11-07 20:50:01,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:01,455 INFO L933 BasicCegarLoop]: 26417 mSDtfsCounter, 26563 mSDsluCounter, 26259 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26563 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.86ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.99ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:01,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26563 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 44.86ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.99ms Time] [2021-11-07 20:50:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20806 states. [2021-11-07 20:50:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20806 to 20806. [2021-11-07 20:50:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20806 states, 20589 states have (on average 1.2892806838603137) internal successors, (26545), 20805 states have internal predecessors, (26545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 26545 transitions. [2021-11-07 20:50:01,936 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 26545 transitions. Word has length 21 [2021-11-07 20:50:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:01,936 INFO L470 AbstractCegarLoop]: Abstraction has 20806 states and 26545 transitions. [2021-11-07 20:50:01,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 26545 transitions. [2021-11-07 20:50:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 20:50:01,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:01,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:01,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 20:50:01,937 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1489564549, now seen corresponding path program 1 times [2021-11-07 20:50:01,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:01,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274959792] [2021-11-07 20:50:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:01,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:02,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:02,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274959792] [2021-11-07 20:50:02,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274959792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:02,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:02,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:02,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586646133] [2021-11-07 20:50:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:02,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:02,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:02,323 INFO L87 Difference]: Start difference. First operand 20806 states and 26545 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:02,783 INFO L93 Difference]: Finished difference Result 20806 states and 26545 transitions. [2021-11-07 20:50:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:02,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-11-07 20:50:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:02,818 INFO L225 Difference]: With dead ends: 20806 [2021-11-07 20:50:02,818 INFO L226 Difference]: Without dead ends: 20802 [2021-11-07 20:50:02,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:02,828 INFO L933 BasicCegarLoop]: 26413 mSDtfsCounter, 26549 mSDsluCounter, 26263 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26549 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.66ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.40ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:02,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26549 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 43.66ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 15.40ms Time] [2021-11-07 20:50:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2021-11-07 20:50:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 20802. [2021-11-07 20:50:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20802 states, 20587 states have (on average 1.2892116384125905) internal successors, (26541), 20801 states have internal predecessors, (26541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20802 states to 20802 states and 26541 transitions. [2021-11-07 20:50:03,418 INFO L78 Accepts]: Start accepts. Automaton has 20802 states and 26541 transitions. Word has length 23 [2021-11-07 20:50:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:03,418 INFO L470 AbstractCegarLoop]: Abstraction has 20802 states and 26541 transitions. [2021-11-07 20:50:03,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20802 states and 26541 transitions. [2021-11-07 20:50:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 20:50:03,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:03,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:03,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 20:50:03,421 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1247634345, now seen corresponding path program 1 times [2021-11-07 20:50:03,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:03,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028836262] [2021-11-07 20:50:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:03,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:03,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:03,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028836262] [2021-11-07 20:50:03,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028836262] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:03,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:03,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:03,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611050841] [2021-11-07 20:50:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:03,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:03,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:03,678 INFO L87 Difference]: Start difference. First operand 20802 states and 26541 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:04,328 INFO L93 Difference]: Finished difference Result 20802 states and 26541 transitions. [2021-11-07 20:50:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-11-07 20:50:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:04,364 INFO L225 Difference]: With dead ends: 20802 [2021-11-07 20:50:04,365 INFO L226 Difference]: Without dead ends: 20798 [2021-11-07 20:50:04,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.23ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:04,374 INFO L933 BasicCegarLoop]: 26409 mSDtfsCounter, 26535 mSDsluCounter, 26267 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26535 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.99ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.71ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:04,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26535 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 42.99ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.71ms Time] [2021-11-07 20:50:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20798 states. [2021-11-07 20:50:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20798 to 20798. [2021-11-07 20:50:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20798 states, 20585 states have (on average 1.2891425795482148) internal successors, (26537), 20797 states have internal predecessors, (26537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20798 states to 20798 states and 26537 transitions. [2021-11-07 20:50:04,984 INFO L78 Accepts]: Start accepts. Automaton has 20798 states and 26537 transitions. Word has length 25 [2021-11-07 20:50:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:04,984 INFO L470 AbstractCegarLoop]: Abstraction has 20798 states and 26537 transitions. [2021-11-07 20:50:04,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 20798 states and 26537 transitions. [2021-11-07 20:50:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 20:50:04,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:04,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:04,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 20:50:04,985 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 680942637, now seen corresponding path program 1 times [2021-11-07 20:50:04,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:04,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62432408] [2021-11-07 20:50:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:04,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:05,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:05,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62432408] [2021-11-07 20:50:05,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62432408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:05,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:05,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:05,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361811133] [2021-11-07 20:50:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:05,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:05,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:05,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:05,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:05,208 INFO L87 Difference]: Start difference. First operand 20798 states and 26537 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:05,882 INFO L93 Difference]: Finished difference Result 20798 states and 26537 transitions. [2021-11-07 20:50:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-11-07 20:50:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:05,911 INFO L225 Difference]: With dead ends: 20798 [2021-11-07 20:50:05,912 INFO L226 Difference]: Without dead ends: 20794 [2021-11-07 20:50:05,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.71ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:05,918 INFO L933 BasicCegarLoop]: 26405 mSDtfsCounter, 26521 mSDsluCounter, 26271 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26521 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.17ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.41ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:05,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26521 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 42.17ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.41ms Time] [2021-11-07 20:50:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20794 states. [2021-11-07 20:50:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20794 to 20794. [2021-11-07 20:50:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20794 states, 20583 states have (on average 1.2890735072632755) internal successors, (26533), 20793 states have internal predecessors, (26533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20794 states to 20794 states and 26533 transitions. [2021-11-07 20:50:06,430 INFO L78 Accepts]: Start accepts. Automaton has 20794 states and 26533 transitions. Word has length 27 [2021-11-07 20:50:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:06,430 INFO L470 AbstractCegarLoop]: Abstraction has 20794 states and 26533 transitions. [2021-11-07 20:50:06,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20794 states and 26533 transitions. [2021-11-07 20:50:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 20:50:06,431 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:06,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:06,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 20:50:06,431 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1551058193, now seen corresponding path program 1 times [2021-11-07 20:50:06,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:06,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471605620] [2021-11-07 20:50:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:06,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:06,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:06,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471605620] [2021-11-07 20:50:06,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471605620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:06,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:06,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:06,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239812865] [2021-11-07 20:50:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:06,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:06,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:06,695 INFO L87 Difference]: Start difference. First operand 20794 states and 26533 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:07,234 INFO L93 Difference]: Finished difference Result 20794 states and 26533 transitions. [2021-11-07 20:50:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-07 20:50:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:07,270 INFO L225 Difference]: With dead ends: 20794 [2021-11-07 20:50:07,270 INFO L226 Difference]: Without dead ends: 20790 [2021-11-07 20:50:07,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:07,281 INFO L933 BasicCegarLoop]: 26401 mSDtfsCounter, 26507 mSDsluCounter, 26275 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26507 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.88ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.57ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:07,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26507 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 43.88ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.57ms Time] [2021-11-07 20:50:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20790 states. [2021-11-07 20:50:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20790 to 20790. [2021-11-07 20:50:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20790 states, 20581 states have (on average 1.2890044215538603) internal successors, (26529), 20789 states have internal predecessors, (26529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20790 states to 20790 states and 26529 transitions. [2021-11-07 20:50:07,941 INFO L78 Accepts]: Start accepts. Automaton has 20790 states and 26529 transitions. Word has length 29 [2021-11-07 20:50:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:07,941 INFO L470 AbstractCegarLoop]: Abstraction has 20790 states and 26529 transitions. [2021-11-07 20:50:07,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20790 states and 26529 transitions. [2021-11-07 20:50:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 20:50:07,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:07,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:07,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 20:50:07,943 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 213485141, now seen corresponding path program 1 times [2021-11-07 20:50:07,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:07,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582961634] [2021-11-07 20:50:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:07,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:08,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:08,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582961634] [2021-11-07 20:50:08,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582961634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:08,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:08,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:08,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544049286] [2021-11-07 20:50:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:08,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:08,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:08,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:08,141 INFO L87 Difference]: Start difference. First operand 20790 states and 26529 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:08,821 INFO L93 Difference]: Finished difference Result 20790 states and 26529 transitions. [2021-11-07 20:50:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:08,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-07 20:50:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:08,848 INFO L225 Difference]: With dead ends: 20790 [2021-11-07 20:50:08,848 INFO L226 Difference]: Without dead ends: 20786 [2021-11-07 20:50:08,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:08,854 INFO L933 BasicCegarLoop]: 26397 mSDtfsCounter, 26493 mSDsluCounter, 26279 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26493 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.76ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.46ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:08,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26493 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 42.76ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.46ms Time] [2021-11-07 20:50:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20786 states. [2021-11-07 20:50:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20786 to 20786. [2021-11-07 20:50:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20786 states, 20579 states have (on average 1.2889353224160551) internal successors, (26525), 20785 states have internal predecessors, (26525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20786 states to 20786 states and 26525 transitions. [2021-11-07 20:50:09,408 INFO L78 Accepts]: Start accepts. Automaton has 20786 states and 26525 transitions. Word has length 31 [2021-11-07 20:50:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:09,409 INFO L470 AbstractCegarLoop]: Abstraction has 20786 states and 26525 transitions. [2021-11-07 20:50:09,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 20786 states and 26525 transitions. [2021-11-07 20:50:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 20:50:09,409 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:09,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:09,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 20:50:09,409 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash -998995975, now seen corresponding path program 1 times [2021-11-07 20:50:09,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:09,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005731521] [2021-11-07 20:50:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:09,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50: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-07 20:50:09,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:09,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005731521] [2021-11-07 20:50:09,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005731521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:09,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:09,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:09,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929381059] [2021-11-07 20:50:09,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:09,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:09,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:09,605 INFO L87 Difference]: Start difference. First operand 20786 states and 26525 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:10,243 INFO L93 Difference]: Finished difference Result 20786 states and 26525 transitions. [2021-11-07 20:50:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:10,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-07 20:50:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:10,277 INFO L225 Difference]: With dead ends: 20786 [2021-11-07 20:50:10,277 INFO L226 Difference]: Without dead ends: 20782 [2021-11-07 20:50:10,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.27ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:10,287 INFO L933 BasicCegarLoop]: 26393 mSDtfsCounter, 26479 mSDsluCounter, 26283 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26479 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.23ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.22ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:10,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26479 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 42.23ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 18.22ms Time] [2021-11-07 20:50:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20782 states. [2021-11-07 20:50:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20782 to 20782. [2021-11-07 20:50:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20782 states, 20577 states have (on average 1.2888662098459445) internal successors, (26521), 20781 states have internal predecessors, (26521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20782 states to 20782 states and 26521 transitions. [2021-11-07 20:50:10,997 INFO L78 Accepts]: Start accepts. Automaton has 20782 states and 26521 transitions. Word has length 33 [2021-11-07 20:50:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:10,997 INFO L470 AbstractCegarLoop]: Abstraction has 20782 states and 26521 transitions. [2021-11-07 20:50:10,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 20782 states and 26521 transitions. [2021-11-07 20:50:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 20:50:10,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:10,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:10,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 20:50:10,998 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2037756413, now seen corresponding path program 1 times [2021-11-07 20:50:10,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:10,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685587472] [2021-11-07 20:50:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:10,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:11,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:11,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685587472] [2021-11-07 20:50:11,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685587472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:11,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:11,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:11,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575756991] [2021-11-07 20:50:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:11,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:11,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:11,194 INFO L87 Difference]: Start difference. First operand 20782 states and 26521 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:11,912 INFO L93 Difference]: Finished difference Result 20782 states and 26521 transitions. [2021-11-07 20:50:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-07 20:50:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:11,940 INFO L225 Difference]: With dead ends: 20782 [2021-11-07 20:50:11,940 INFO L226 Difference]: Without dead ends: 20778 [2021-11-07 20:50:11,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.57ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:11,946 INFO L933 BasicCegarLoop]: 26389 mSDtfsCounter, 26465 mSDsluCounter, 26287 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26465 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 45.33ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.59ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:11,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26465 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 45.33ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 18.59ms Time] [2021-11-07 20:50:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20778 states. [2021-11-07 20:50:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20778 to 20778. [2021-11-07 20:50:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20778 states, 20575 states have (on average 1.2887970838396112) internal successors, (26517), 20777 states have internal predecessors, (26517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20778 states to 20778 states and 26517 transitions. [2021-11-07 20:50:12,557 INFO L78 Accepts]: Start accepts. Automaton has 20778 states and 26517 transitions. Word has length 35 [2021-11-07 20:50:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:12,557 INFO L470 AbstractCegarLoop]: Abstraction has 20778 states and 26517 transitions. [2021-11-07 20:50:12,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20778 states and 26517 transitions. [2021-11-07 20:50:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 20:50:12,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:12,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:12,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 20:50:12,558 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash -220960640, now seen corresponding path program 1 times [2021-11-07 20:50:12,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:12,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942920682] [2021-11-07 20:50:12,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:12,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:12,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:12,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942920682] [2021-11-07 20:50:12,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942920682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:12,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:12,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:12,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520798646] [2021-11-07 20:50:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:12,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:12,764 INFO L87 Difference]: Start difference. First operand 20778 states and 26517 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:13,478 INFO L93 Difference]: Finished difference Result 20778 states and 26517 transitions. [2021-11-07 20:50:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-07 20:50:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:13,513 INFO L225 Difference]: With dead ends: 20778 [2021-11-07 20:50:13,513 INFO L226 Difference]: Without dead ends: 20774 [2021-11-07 20:50:13,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.93ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:13,523 INFO L933 BasicCegarLoop]: 26385 mSDtfsCounter, 26451 mSDsluCounter, 26291 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26451 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.76ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.31ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:13,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26451 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 46.76ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 18.31ms Time] [2021-11-07 20:50:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20774 states. [2021-11-07 20:50:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20774 to 20774. [2021-11-07 20:50:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20774 states, 20573 states have (on average 1.2887279443931365) internal successors, (26513), 20773 states have internal predecessors, (26513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20774 states to 20774 states and 26513 transitions. [2021-11-07 20:50:14,199 INFO L78 Accepts]: Start accepts. Automaton has 20774 states and 26513 transitions. Word has length 37 [2021-11-07 20:50:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:14,199 INFO L470 AbstractCegarLoop]: Abstraction has 20774 states and 26513 transitions. [2021-11-07 20:50:14,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 20774 states and 26513 transitions. [2021-11-07 20:50:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 20:50:14,200 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:14,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:14,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 20:50:14,200 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1889562780, now seen corresponding path program 1 times [2021-11-07 20:50:14,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:14,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43942194] [2021-11-07 20:50:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:14,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:14,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:14,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43942194] [2021-11-07 20:50:14,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43942194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:14,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:14,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:14,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028899544] [2021-11-07 20:50:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:14,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:14,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:14,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:14,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:14,469 INFO L87 Difference]: Start difference. First operand 20774 states and 26513 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:15,151 INFO L93 Difference]: Finished difference Result 20774 states and 26513 transitions. [2021-11-07 20:50:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-07 20:50:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:15,187 INFO L225 Difference]: With dead ends: 20774 [2021-11-07 20:50:15,187 INFO L226 Difference]: Without dead ends: 20770 [2021-11-07 20:50:15,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:15,197 INFO L933 BasicCegarLoop]: 26381 mSDtfsCounter, 26437 mSDsluCounter, 26295 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26437 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.28ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.33ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:15,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26437 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 46.28ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.33ms Time] [2021-11-07 20:50:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20770 states. [2021-11-07 20:50:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20770 to 20770. [2021-11-07 20:50:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20770 states, 20571 states have (on average 1.2886587915026007) internal successors, (26509), 20769 states have internal predecessors, (26509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20770 states to 20770 states and 26509 transitions. [2021-11-07 20:50:16,000 INFO L78 Accepts]: Start accepts. Automaton has 20770 states and 26509 transitions. Word has length 39 [2021-11-07 20:50:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:16,001 INFO L470 AbstractCegarLoop]: Abstraction has 20770 states and 26509 transitions. [2021-11-07 20:50:16,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 20770 states and 26509 transitions. [2021-11-07 20:50:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-07 20:50:16,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:16,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:16,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 20:50:16,002 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 901549736, now seen corresponding path program 1 times [2021-11-07 20:50:16,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:16,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884403115] [2021-11-07 20:50:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:16,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:16,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:16,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884403115] [2021-11-07 20:50:16,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884403115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:16,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:16,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:16,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657083383] [2021-11-07 20:50:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:16,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:16,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:16,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:16,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:16,203 INFO L87 Difference]: Start difference. First operand 20770 states and 26509 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:16,897 INFO L93 Difference]: Finished difference Result 20770 states and 26509 transitions. [2021-11-07 20:50:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-07 20:50:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:16,929 INFO L225 Difference]: With dead ends: 20770 [2021-11-07 20:50:16,929 INFO L226 Difference]: Without dead ends: 20766 [2021-11-07 20:50:16,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:16,938 INFO L933 BasicCegarLoop]: 26377 mSDtfsCounter, 26423 mSDsluCounter, 26299 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26423 SdHoareTripleChecker+Valid, 52676 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.78ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:16,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26423 Valid, 52676 Invalid, 6 Unknown, 0 Unchecked, 44.48ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.78ms Time] [2021-11-07 20:50:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2021-11-07 20:50:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20766. [2021-11-07 20:50:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20766 states, 20569 states have (on average 1.2885896251640818) internal successors, (26505), 20765 states have internal predecessors, (26505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 26505 transitions. [2021-11-07 20:50:17,877 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 26505 transitions. Word has length 41 [2021-11-07 20:50:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:17,877 INFO L470 AbstractCegarLoop]: Abstraction has 20766 states and 26505 transitions. [2021-11-07 20:50:17,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 26505 transitions. [2021-11-07 20:50:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 20:50:17,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:17,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:17,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 20:50:17,879 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1768886377, now seen corresponding path program 1 times [2021-11-07 20:50:17,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:17,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062997652] [2021-11-07 20:50:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:17,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:18,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:18,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062997652] [2021-11-07 20:50:18,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062997652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:18,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:18,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:18,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932913390] [2021-11-07 20:50:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:18,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:18,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:18,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:18,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:18,136 INFO L87 Difference]: Start difference. First operand 20766 states and 26505 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:21,197 INFO L93 Difference]: Finished difference Result 43349 states and 55072 transitions. [2021-11-07 20:50:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 20:50:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 20:50:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:21,272 INFO L225 Difference]: With dead ends: 43349 [2021-11-07 20:50:21,272 INFO L226 Difference]: Without dead ends: 43325 [2021-11-07 20:50:21,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:21,292 INFO L933 BasicCegarLoop]: 29897 mSDtfsCounter, 76700 mSDsluCounter, 28838 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1161.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76700 SdHoareTripleChecker+Valid, 58735 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 91.49ms SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1265.37ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:21,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76700 Valid, 58735 Invalid, 377 Unknown, 0 Unchecked, 91.49ms Time], IncrementalHoareTripleChecker [132 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1265.37ms Time] [2021-11-07 20:50:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43325 states. [2021-11-07 20:50:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43325 to 40110. [2021-11-07 20:50:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40110 states, 39918 states have (on average 1.2909965429129715) internal successors, (51534), 40109 states have internal predecessors, (51534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40110 states to 40110 states and 51534 transitions. [2021-11-07 20:50:22,930 INFO L78 Accepts]: Start accepts. Automaton has 40110 states and 51534 transitions. Word has length 43 [2021-11-07 20:50:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:22,931 INFO L470 AbstractCegarLoop]: Abstraction has 40110 states and 51534 transitions. [2021-11-07 20:50:22,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 40110 states and 51534 transitions. [2021-11-07 20:50:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 20:50:22,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:22,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:22,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 20:50:22,932 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1193882036, now seen corresponding path program 1 times [2021-11-07 20:50:22,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:22,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113993020] [2021-11-07 20:50:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:22,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:23,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:23,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113993020] [2021-11-07 20:50:23,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113993020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:23,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:23,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:23,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779568809] [2021-11-07 20:50:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:23,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:23,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:23,133 INFO L87 Difference]: Start difference. First operand 40110 states and 51534 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 20:50:24,613 INFO L93 Difference]: Finished difference Result 40110 states and 51534 transitions. [2021-11-07 20:50:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 20:50:24,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 20:50:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 20:50:24,687 INFO L225 Difference]: With dead ends: 40110 [2021-11-07 20:50:24,688 INFO L226 Difference]: Without dead ends: 40106 [2021-11-07 20:50:24,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.93ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 20:50:24,707 INFO L933 BasicCegarLoop]: 26363 mSDtfsCounter, 26399 mSDsluCounter, 26293 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26399 SdHoareTripleChecker+Valid, 52656 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 49.95ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.44ms IncrementalHoareTripleChecker+Time [2021-11-07 20:50:24,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26399 Valid, 52656 Invalid, 6 Unknown, 0 Unchecked, 49.95ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 17.44ms Time] [2021-11-07 20:50:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40106 states. [2021-11-07 20:50:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40106 to 40106. [2021-11-07 20:50:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40106 states, 39916 states have (on average 1.29096101813809) internal successors, (51530), 40105 states have internal predecessors, (51530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40106 states to 40106 states and 51530 transitions. [2021-11-07 20:50:26,431 INFO L78 Accepts]: Start accepts. Automaton has 40106 states and 51530 transitions. Word has length 43 [2021-11-07 20:50:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 20:50:26,431 INFO L470 AbstractCegarLoop]: Abstraction has 40106 states and 51530 transitions. [2021-11-07 20:50:26,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 20:50:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40106 states and 51530 transitions. [2021-11-07 20:50:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 20:50:26,432 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 20:50:26,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 20:50:26,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 20:50:26,432 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 536 more)] === [2021-11-07 20:50:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 20:50:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -564152752, now seen corresponding path program 1 times [2021-11-07 20:50:26,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 20:50:26,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701928067] [2021-11-07 20:50:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 20:50:26,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 20:50:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 20:50:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 20:50:26,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 20:50:26,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701928067] [2021-11-07 20:50:26,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701928067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 20:50:26,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 20:50:26,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 20:50:26,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384440729] [2021-11-07 20:50:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 20:50:26,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 20:50:26,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 20:50:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 20:50:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 20:50:26,764 INFO L87 Difference]: Start difference. First operand 40106 states and 51530 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)