./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 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---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-dev-173e394 [2021-11-06 22:13:12,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 22:13:12,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 22:13:12,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 22:13:12,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 22:13:12,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 22:13:12,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 22:13:12,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 22:13:12,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 22:13:12,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 22:13:12,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 22:13:12,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 22:13:12,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 22:13:12,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 22:13:12,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 22:13:12,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 22:13:12,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 22:13:12,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 22:13:12,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 22:13:12,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 22:13:12,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 22:13:12,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 22:13:12,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 22:13:12,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 22:13:12,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 22:13:12,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 22:13:12,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 22:13:12,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 22:13:12,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 22:13:12,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 22:13:12,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 22:13:12,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 22:13:12,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 22:13:12,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 22:13:12,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 22:13:12,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 22:13:12,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 22:13:12,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 22:13:12,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 22:13:12,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 22:13:12,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 22:13:12,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 22:13:12,482 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 22:13:12,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 22:13:12,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 22:13:12,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 22:13:12,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 22:13:12,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 22:13:12,486 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 22:13:12,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 22:13:12,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 22:13:12,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 22:13:12,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 22:13:12,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 22:13:12,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 22:13:12,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 22:13:12,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 22:13:12,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 22:13:12,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 22:13:12,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 22:13:12,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 22:13:12,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:13:12,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 22:13:12,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 22:13:12,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 22:13:12,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 22:13:12,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 22:13:12,490 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 22:13:12,491 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 22:13:12,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 22:13:12,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 22:13:12,491 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-06 22:13:12,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 22:13:12,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 22:13:12,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 22:13:12,807 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 22:13:12,808 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 22:13:12,809 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-06 22:13:12,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e0c413f/b33371437b1f406bacb063c728e4afba/FLAG658e42517 [2021-11-06 22:13:13,785 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 22:13:13,786 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-06 22:13:13,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e0c413f/b33371437b1f406bacb063c728e4afba/FLAG658e42517 [2021-11-06 22:13:14,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e0c413f/b33371437b1f406bacb063c728e4afba [2021-11-06 22:13:14,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 22:13:14,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 22:13:14,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 22:13:14,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 22:13:14,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 22:13:14,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:14" (1/1) ... [2021-11-06 22:13:14,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c980083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:14, skipping insertion in model container [2021-11-06 22:13:14,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:13:14" (1/1) ... [2021-11-06 22:13:14,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 22:13:14,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 22:13:22,942 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,945 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,945 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,946 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,946 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,947 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,947 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,947 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,948 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,948 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,949 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,949 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,949 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,950 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,950 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,953 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,953 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,953 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,954 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,954 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,955 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,955 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,955 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,957 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,958 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,958 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,959 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,959 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,959 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,960 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,960 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,960 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,961 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,962 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,963 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,963 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,965 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,965 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,965 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,966 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,966 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,966 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,967 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,967 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,967 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,969 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,969 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,969 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,970 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,970 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,972 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,972 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,972 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,973 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,973 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,973 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,974 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,974 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,974 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,975 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,975 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:22,977 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:13:23,045 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 22:13:23,864 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,866 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,869 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,871 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,872 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,872 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,873 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,874 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,875 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,875 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,876 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,876 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,877 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,877 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,879 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,895 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,896 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,897 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,898 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,898 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,899 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,901 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,902 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,903 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,906 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,908 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,909 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,912 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,913 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,917 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,938 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,939 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,940 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,941 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,941 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,942 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,942 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,942 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,942 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,947 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,947 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,948 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,948 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,949 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,949 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,950 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,950 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,952 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-06 22:13:23,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:13:24,286 INFO L208 MainTranslator]: Completed translation [2021-11-06 22:13:24,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24 WrapperNode [2021-11-06 22:13:24,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 22:13:24,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 22:13:24,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 22:13:24,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 22:13:24,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:24,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:28,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 22:13:28,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 22:13:28,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 22:13:28,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 22:13:28,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:28,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:29,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:29,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:31,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:31,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:31,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:32,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 22:13:32,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 22:13:32,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 22:13:32,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 22:13:32,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (1/1) ... [2021-11-06 22:13:32,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:13:32,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:13:32,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 22:13:32,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 22:13:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 22:13:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure sock_wfree [2021-11-06 22:13:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 22:13:32,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-11-06 22:13:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 22:13:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 22:13:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 22:13:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 22:13:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 22:13:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 22:13:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 22:13:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 22:13:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 22:18:11,875 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 22:18:11,878 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L11799: #t~ret2561 := main_#res; [2021-11-06 22:18:11,878 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_27_returnLabel: main_#res := 0; [2021-11-06 22:18:11,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 22:18:11,951 INFO L299 CfgBuilder]: Removed 23684 assume(true) statements. [2021-11-06 22:18:11,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:11 BoogieIcfgContainer [2021-11-06 22:18:11,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 22:18:11,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 22:18:11,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 22:18:11,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 22:18:11,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:13:14" (1/3) ... [2021-11-06 22:18:11,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bd92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:11, skipping insertion in model container [2021-11-06 22:18:11,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:13:24" (2/3) ... [2021-11-06 22:18:11,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bd92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:11, skipping insertion in model container [2021-11-06 22:18:11,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:11" (3/3) ... [2021-11-06 22:18:11,977 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-06 22:18:11,982 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 22:18:11,982 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 539 error locations. [2021-11-06 22:18:12,069 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 22:18:12,073 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 22:18:12,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 539 error locations. [2021-11-06 22:18:12,445 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-06 22:18:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 22:18:12,450 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:12,450 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:12,451 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-06 22:18:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1421350192, now seen corresponding path program 1 times [2021-11-06 22:18:12,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:12,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464260753] [2021-11-06 22:18:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:12,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:13,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:13,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464260753] [2021-11-06 22:18:13,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464260753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:13,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:13,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:18:13,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984948867] [2021-11-06 22:18:13,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:18:13,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:13,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:18:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:13,393 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-06 22:18:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:20,223 INFO L93 Difference]: Finished difference Result 54177 states and 73821 transitions. [2021-11-06 22:18:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:18:20,224 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-06 22:18:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:20,350 INFO L225 Difference]: With dead ends: 54177 [2021-11-06 22:18:20,350 INFO L226 Difference]: Without dead ends: 28622 [2021-11-06 22:18:20,404 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:18:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28622 states. [2021-11-06 22:18:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28622 to 21517. [2021-11-06 22:18:21,075 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-06 22:18:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21517 states to 21517 states and 27447 transitions. [2021-11-06 22:18:21,139 INFO L78 Accepts]: Start accepts. Automaton has 21517 states and 27447 transitions. Word has length 12 [2021-11-06 22:18:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:21,141 INFO L470 AbstractCegarLoop]: Abstraction has 21517 states and 27447 transitions. [2021-11-06 22:18:21,141 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-06 22:18:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21517 states and 27447 transitions. [2021-11-06 22:18:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 22:18:21,143 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:21,143 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:21,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 22:18:21,144 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-06 22:18:21,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1421290610, now seen corresponding path program 1 times [2021-11-06 22:18:21,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:21,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93936022] [2021-11-06 22:18:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:21,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:21,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:21,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93936022] [2021-11-06 22:18:21,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93936022] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:21,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:21,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:18:21,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856399136] [2021-11-06 22:18:21,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:21,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:21,437 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-06 22:18:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:27,732 INFO L93 Difference]: Finished difference Result 34483 states and 44247 transitions. [2021-11-06 22:18:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:18:27,732 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-06 22:18:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:27,793 INFO L225 Difference]: With dead ends: 34483 [2021-11-06 22:18:27,794 INFO L226 Difference]: Without dead ends: 34101 [2021-11-06 22:18:27,805 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34101 states. [2021-11-06 22:18:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34101 to 21383. [2021-11-06 22:18:28,468 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-06 22:18:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21383 states to 21383 states and 27313 transitions. [2021-11-06 22:18:28,516 INFO L78 Accepts]: Start accepts. Automaton has 21383 states and 27313 transitions. Word has length 12 [2021-11-06 22:18:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:28,517 INFO L470 AbstractCegarLoop]: Abstraction has 21383 states and 27313 transitions. [2021-11-06 22:18:28,517 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-06 22:18:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21383 states and 27313 transitions. [2021-11-06 22:18:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-06 22:18:28,518 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:28,518 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:28,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 22:18:28,518 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-06 22:18:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1877009153, now seen corresponding path program 1 times [2021-11-06 22:18:28,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:28,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463077040] [2021-11-06 22:18:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:28,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:28,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:28,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463077040] [2021-11-06 22:18:28,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463077040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:28,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:28,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 22:18:28,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739606978] [2021-11-06 22:18:28,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:18:28,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:28,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:18:28,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:18:28,778 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-06 22:18:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:30,294 INFO L93 Difference]: Finished difference Result 42180 states and 54037 transitions. [2021-11-06 22:18:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:18:30,294 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-06 22:18:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:30,347 INFO L225 Difference]: With dead ends: 42180 [2021-11-06 22:18:30,347 INFO L226 Difference]: Without dead ends: 20810 [2021-11-06 22:18:30,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:18:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20810 states. [2021-11-06 22:18:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20810 to 20810. [2021-11-06 22:18:31,037 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-06 22:18:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20810 states to 20810 states and 26549 transitions. [2021-11-06 22:18:31,076 INFO L78 Accepts]: Start accepts. Automaton has 20810 states and 26549 transitions. Word has length 15 [2021-11-06 22:18:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:31,077 INFO L470 AbstractCegarLoop]: Abstraction has 20810 states and 26549 transitions. [2021-11-06 22:18:31,077 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-06 22:18:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20810 states and 26549 transitions. [2021-11-06 22:18:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-06 22:18:31,078 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:31,078 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:31,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 22:18:31,078 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-06 22:18:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1646240705, now seen corresponding path program 1 times [2021-11-06 22:18:31,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:31,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834875847] [2021-11-06 22:18:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:31,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:31,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:31,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834875847] [2021-11-06 22:18:31,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834875847] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:31,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:31,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:31,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505152795] [2021-11-06 22:18:31,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:31,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:31,384 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-06 22:18:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:31,994 INFO L93 Difference]: Finished difference Result 20810 states and 26549 transitions. [2021-11-06 22:18:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:31,995 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-06 22:18:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:32,032 INFO L225 Difference]: With dead ends: 20810 [2021-11-06 22:18:32,033 INFO L226 Difference]: Without dead ends: 20806 [2021-11-06 22:18:32,043 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20806 states. [2021-11-06 22:18:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20806 to 20806. [2021-11-06 22:18:32,566 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-06 22:18:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 26545 transitions. [2021-11-06 22:18:32,603 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 26545 transitions. Word has length 21 [2021-11-06 22:18:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:32,604 INFO L470 AbstractCegarLoop]: Abstraction has 20806 states and 26545 transitions. [2021-11-06 22:18:32,604 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-06 22:18:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 26545 transitions. [2021-11-06 22:18:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-06 22:18:32,606 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:32,606 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:32,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 22:18:32,606 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-06 22:18:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1489564549, now seen corresponding path program 1 times [2021-11-06 22:18:32,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:32,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671190918] [2021-11-06 22:18:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:32,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:32,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:32,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671190918] [2021-11-06 22:18:32,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671190918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:32,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:32,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:32,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547211188] [2021-11-06 22:18:32,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:32,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:32,920 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-06 22:18:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:33,455 INFO L93 Difference]: Finished difference Result 20806 states and 26545 transitions. [2021-11-06 22:18:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:33,455 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-06 22:18:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:33,491 INFO L225 Difference]: With dead ends: 20806 [2021-11-06 22:18:33,491 INFO L226 Difference]: Without dead ends: 20802 [2021-11-06 22:18:33,498 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2021-11-06 22:18:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 20802. [2021-11-06 22:18:33,973 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-06 22:18:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20802 states to 20802 states and 26541 transitions. [2021-11-06 22:18:34,144 INFO L78 Accepts]: Start accepts. Automaton has 20802 states and 26541 transitions. Word has length 23 [2021-11-06 22:18:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:34,144 INFO L470 AbstractCegarLoop]: Abstraction has 20802 states and 26541 transitions. [2021-11-06 22:18:34,145 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-06 22:18:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 20802 states and 26541 transitions. [2021-11-06 22:18:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 22:18:34,145 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:34,146 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:34,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 22:18:34,146 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-06 22:18:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1247634345, now seen corresponding path program 1 times [2021-11-06 22:18:34,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:34,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155713101] [2021-11-06 22:18:34,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:34,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:34,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:34,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155713101] [2021-11-06 22:18:34,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155713101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:34,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:34,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:34,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685552375] [2021-11-06 22:18:34,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:34,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:34,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:34,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:34,429 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-06 22:18:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:34,966 INFO L93 Difference]: Finished difference Result 20802 states and 26541 transitions. [2021-11-06 22:18:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:34,966 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-06 22:18:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:35,006 INFO L225 Difference]: With dead ends: 20802 [2021-11-06 22:18:35,007 INFO L226 Difference]: Without dead ends: 20798 [2021-11-06 22:18:35,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20798 states. [2021-11-06 22:18:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20798 to 20798. [2021-11-06 22:18:35,585 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-06 22:18:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20798 states to 20798 states and 26537 transitions. [2021-11-06 22:18:35,612 INFO L78 Accepts]: Start accepts. Automaton has 20798 states and 26537 transitions. Word has length 25 [2021-11-06 22:18:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:35,613 INFO L470 AbstractCegarLoop]: Abstraction has 20798 states and 26537 transitions. [2021-11-06 22:18:35,613 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-06 22:18:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 20798 states and 26537 transitions. [2021-11-06 22:18:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-06 22:18:35,614 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:35,614 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:35,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 22:18:35,614 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-06 22:18:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash 680942637, now seen corresponding path program 1 times [2021-11-06 22:18:35,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:35,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273508738] [2021-11-06 22:18:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:35,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:35,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:35,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273508738] [2021-11-06 22:18:35,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273508738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:35,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:35,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:35,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465083239] [2021-11-06 22:18:35,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:35,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:35,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:35,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:35,872 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-06 22:18:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:36,604 INFO L93 Difference]: Finished difference Result 20798 states and 26537 transitions. [2021-11-06 22:18:36,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:36,605 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-06 22:18:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:36,643 INFO L225 Difference]: With dead ends: 20798 [2021-11-06 22:18:36,643 INFO L226 Difference]: Without dead ends: 20794 [2021-11-06 22:18:36,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20794 states. [2021-11-06 22:18:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20794 to 20794. [2021-11-06 22:18:37,286 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-06 22:18:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20794 states to 20794 states and 26533 transitions. [2021-11-06 22:18:37,313 INFO L78 Accepts]: Start accepts. Automaton has 20794 states and 26533 transitions. Word has length 27 [2021-11-06 22:18:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:37,314 INFO L470 AbstractCegarLoop]: Abstraction has 20794 states and 26533 transitions. [2021-11-06 22:18:37,314 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-06 22:18:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20794 states and 26533 transitions. [2021-11-06 22:18:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 22:18:37,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:37,315 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:37,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 22:18:37,315 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-06 22:18:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:37,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1551058193, now seen corresponding path program 1 times [2021-11-06 22:18:37,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:37,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135550186] [2021-11-06 22:18:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:37,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:37,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:37,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135550186] [2021-11-06 22:18:37,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135550186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:37,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:37,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:37,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197519827] [2021-11-06 22:18:37,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:37,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:37,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:37,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:37,558 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-06 22:18:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:38,168 INFO L93 Difference]: Finished difference Result 20794 states and 26533 transitions. [2021-11-06 22:18:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:38,169 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-06 22:18:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:38,200 INFO L225 Difference]: With dead ends: 20794 [2021-11-06 22:18:38,200 INFO L226 Difference]: Without dead ends: 20790 [2021-11-06 22:18:38,207 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20790 states. [2021-11-06 22:18:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20790 to 20790. [2021-11-06 22:18:38,817 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-06 22:18:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20790 states to 20790 states and 26529 transitions. [2021-11-06 22:18:38,844 INFO L78 Accepts]: Start accepts. Automaton has 20790 states and 26529 transitions. Word has length 29 [2021-11-06 22:18:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:38,844 INFO L470 AbstractCegarLoop]: Abstraction has 20790 states and 26529 transitions. [2021-11-06 22:18:38,845 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-06 22:18:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 20790 states and 26529 transitions. [2021-11-06 22:18:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 22:18:38,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:38,846 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:38,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 22:18:38,846 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-06 22:18:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash 213485141, now seen corresponding path program 1 times [2021-11-06 22:18:38,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:38,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672484626] [2021-11-06 22:18:38,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:38,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:39,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:39,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672484626] [2021-11-06 22:18:39,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672484626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:39,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:39,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:39,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078602961] [2021-11-06 22:18:39,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:39,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:39,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:39,094 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-06 22:18:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:39,740 INFO L93 Difference]: Finished difference Result 20790 states and 26529 transitions. [2021-11-06 22:18:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:39,741 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-06 22:18:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:39,765 INFO L225 Difference]: With dead ends: 20790 [2021-11-06 22:18:39,766 INFO L226 Difference]: Without dead ends: 20786 [2021-11-06 22:18:39,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20786 states. [2021-11-06 22:18:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20786 to 20786. [2021-11-06 22:18:40,366 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-06 22:18:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20786 states to 20786 states and 26525 transitions. [2021-11-06 22:18:40,393 INFO L78 Accepts]: Start accepts. Automaton has 20786 states and 26525 transitions. Word has length 31 [2021-11-06 22:18:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:40,393 INFO L470 AbstractCegarLoop]: Abstraction has 20786 states and 26525 transitions. [2021-11-06 22:18:40,393 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-06 22:18:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 20786 states and 26525 transitions. [2021-11-06 22:18:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 22:18:40,394 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:40,394 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:40,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 22:18:40,394 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-06 22:18:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash -998995975, now seen corresponding path program 1 times [2021-11-06 22:18:40,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:40,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120575539] [2021-11-06 22:18:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:40,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:40,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:40,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120575539] [2021-11-06 22:18:40,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120575539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:40,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:40,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:40,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810270507] [2021-11-06 22:18:40,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:40,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:40,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:40,630 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-06 22:18:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:41,415 INFO L93 Difference]: Finished difference Result 20786 states and 26525 transitions. [2021-11-06 22:18:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:41,415 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-06 22:18:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:41,442 INFO L225 Difference]: With dead ends: 20786 [2021-11-06 22:18:41,442 INFO L226 Difference]: Without dead ends: 20782 [2021-11-06 22:18:41,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20782 states. [2021-11-06 22:18:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20782 to 20782. [2021-11-06 22:18:42,155 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-06 22:18:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20782 states to 20782 states and 26521 transitions. [2021-11-06 22:18:42,182 INFO L78 Accepts]: Start accepts. Automaton has 20782 states and 26521 transitions. Word has length 33 [2021-11-06 22:18:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:42,182 INFO L470 AbstractCegarLoop]: Abstraction has 20782 states and 26521 transitions. [2021-11-06 22:18:42,182 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-06 22:18:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20782 states and 26521 transitions. [2021-11-06 22:18:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 22:18:42,183 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:42,183 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:42,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 22:18:42,183 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-06 22:18:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2037756413, now seen corresponding path program 1 times [2021-11-06 22:18:42,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:42,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011878469] [2021-11-06 22:18:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:42,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:42,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:42,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011878469] [2021-11-06 22:18:42,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011878469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:42,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:42,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:42,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996257901] [2021-11-06 22:18:42,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:42,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:42,427 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-06 22:18:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:18:43,252 INFO L93 Difference]: Finished difference Result 20782 states and 26521 transitions. [2021-11-06 22:18:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:18:43,253 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-06 22:18:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:18:43,277 INFO L225 Difference]: With dead ends: 20782 [2021-11-06 22:18:43,278 INFO L226 Difference]: Without dead ends: 20778 [2021-11-06 22:18:43,283 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:18:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20778 states. [2021-11-06 22:18:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20778 to 20778. [2021-11-06 22:18:43,919 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-06 22:18:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20778 states to 20778 states and 26517 transitions. [2021-11-06 22:18:43,944 INFO L78 Accepts]: Start accepts. Automaton has 20778 states and 26517 transitions. Word has length 35 [2021-11-06 22:18:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:18:43,944 INFO L470 AbstractCegarLoop]: Abstraction has 20778 states and 26517 transitions. [2021-11-06 22:18:43,945 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-06 22:18:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 20778 states and 26517 transitions. [2021-11-06 22:18:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 22:18:43,945 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:18:43,946 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:18:43,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 22:18:43,946 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-06 22:18:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:18:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -220960640, now seen corresponding path program 1 times [2021-11-06 22:18:43,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:18:43,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114776240] [2021-11-06 22:18:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:18:43,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:18:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:18:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:18:44,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:18:44,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114776240] [2021-11-06 22:18:44,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114776240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:18:44,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:18:44,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:18:44,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463521665] [2021-11-06 22:18:44,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:18:44,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:18:44,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:18:44,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:18:44,205 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)