./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.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 f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:51:16,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:51:16,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:51:16,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:51:16,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:51:16,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:51:16,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:51:16,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:51:16,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:51:16,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:51:16,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:51:16,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:51:16,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:51:16,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:51:16,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:51:16,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:51:16,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:51:16,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:51:16,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:51:16,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:51:16,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:51:16,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:51:16,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:51:16,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:51:16,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:51:16,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:51:16,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:51:16,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:51:16,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:51:16,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:51:16,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:51:16,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:51:16,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:51:16,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:51:16,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:51:16,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:51:16,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:51:16,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:51:16,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:51:16,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:51:16,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:51:16,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 21:51:16,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:51:16,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:51:16,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:51:16,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:51:16,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:51:16,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:51:16,476 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:51:16,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:51:16,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:51:16,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:51:16,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:51:16,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:51:16,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:51:16,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:51:16,477 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:51:16,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:51:16,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:51:16,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:51:16,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:51:16,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:51:16,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:51:16,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:51:16,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:51:16,480 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 -> f0d35ad3183ac446cae7457c51fa9452f8942f4b349e6e40633392db1dd8aa97 [2021-11-06 21:51:16,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:51:16,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:51:16,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:51:16,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:51:16,706 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:51:16,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-11-06 21:51:16,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6c4f4d7/cdcef87bc4514d26907ca1e34edb54b5/FLAG423f4853d [2021-11-06 21:51:17,411 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:51:17,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-11-06 21:51:17,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6c4f4d7/cdcef87bc4514d26907ca1e34edb54b5/FLAG423f4853d [2021-11-06 21:51:17,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6c4f4d7/cdcef87bc4514d26907ca1e34edb54b5 [2021-11-06 21:51:17,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:51:17,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:51:17,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:51:17,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:51:17,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:51:17,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:51:17" (1/1) ... [2021-11-06 21:51:17,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e2a78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:17, skipping insertion in model container [2021-11-06 21:51:17,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:51:17" (1/1) ... [2021-11-06 21:51:17,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:51:17,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:51:19,920 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2021-11-06 21:51:19,922 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2021-11-06 21:51:19,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2021-11-06 21:51:19,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2021-11-06 21:51:19,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2021-11-06 21:51:19,923 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2021-11-06 21:51:19,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-11-06 21:51:19,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-11-06 21:51:19,924 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2021-11-06 21:51:19,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-11-06 21:51:19,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-11-06 21:51:19,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-11-06 21:51:19,927 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-11-06 21:51:19,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2021-11-06 21:51:19,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2021-11-06 21:51:19,928 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2021-11-06 21:51:19,929 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-11-06 21:51:19,929 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-11-06 21:51:19,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-11-06 21:51:19,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-11-06 21:51:19,930 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2021-11-06 21:51:19,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2021-11-06 21:51:19,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2021-11-06 21:51:19,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2021-11-06 21:51:19,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-11-06 21:51:19,933 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-11-06 21:51:19,934 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-11-06 21:51:19,934 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-11-06 21:51:19,934 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-11-06 21:51:19,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-11-06 21:51:19,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-11-06 21:51:19,936 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-11-06 21:51:19,937 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-11-06 21:51:19,937 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-11-06 21:51:19,937 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-11-06 21:51:19,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---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-11-06 21:51:19,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:51:20,027 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:51:20,258 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385539,385552] [2021-11-06 21:51:20,259 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385684,385697] [2021-11-06 21:51:20,261 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385830,385843] [2021-11-06 21:51:20,262 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[385995,386008] [2021-11-06 21:51:20,263 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386153,386166] [2021-11-06 21:51:20,263 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386311,386324] [2021-11-06 21:51:20,264 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386469,386482] [2021-11-06 21:51:20,264 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386629,386642] [2021-11-06 21:51:20,265 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386788,386801] [2021-11-06 21:51:20,265 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[386927,386940] [2021-11-06 21:51:20,265 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387069,387082] [2021-11-06 21:51:20,266 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387218,387231] [2021-11-06 21:51:20,266 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387357,387370] [2021-11-06 21:51:20,266 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387512,387525] [2021-11-06 21:51:20,266 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387672,387685] [2021-11-06 21:51:20,267 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387823,387836] [2021-11-06 21:51:20,267 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[387974,387987] [2021-11-06 21:51:20,267 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388126,388139] [2021-11-06 21:51:20,267 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388275,388288] [2021-11-06 21:51:20,268 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388423,388436] [2021-11-06 21:51:20,268 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388580,388593] [2021-11-06 21:51:20,269 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388729,388742] [2021-11-06 21:51:20,269 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[388885,388898] [2021-11-06 21:51:20,269 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389038,389051] [2021-11-06 21:51:20,270 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389184,389197] [2021-11-06 21:51:20,270 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389327,389340] [2021-11-06 21:51:20,270 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389479,389492] [2021-11-06 21:51:20,270 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389625,389638] [2021-11-06 21:51:20,271 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389770,389783] [2021-11-06 21:51:20,271 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[389924,389937] [2021-11-06 21:51:20,272 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390075,390088] [2021-11-06 21:51:20,272 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390230,390243] [2021-11-06 21:51:20,272 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390382,390395] [2021-11-06 21:51:20,272 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390537,390550] [2021-11-06 21:51:20,273 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390701,390714] [2021-11-06 21:51:20,273 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[390857,390870] [2021-11-06 21:51:20,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391021,391034] [2021-11-06 21:51:20,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391163,391176] [2021-11-06 21:51:20,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391321,391334] [2021-11-06 21:51:20,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391488,391501] [2021-11-06 21:51:20,275 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391647,391660] [2021-11-06 21:51:20,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391806,391819] [2021-11-06 21:51:20,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[391955,391968] [2021-11-06 21:51:20,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392102,392115] [2021-11-06 21:51:20,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392241,392254] [2021-11-06 21:51:20,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392404,392417] [2021-11-06 21:51:20,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392570,392583] [2021-11-06 21:51:20,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392734,392747] [2021-11-06 21:51:20,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[392899,392912] [2021-11-06 21:51:20,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393064,393077] [2021-11-06 21:51:20,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393230,393243] [2021-11-06 21:51:20,278 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393395,393408] [2021-11-06 21:51:20,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393562,393575] [2021-11-06 21:51:20,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393722,393735] [2021-11-06 21:51:20,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[393884,393897] [2021-11-06 21:51:20,280 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394043,394056] [2021-11-06 21:51:20,280 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394189,394202] [2021-11-06 21:51:20,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394332,394345] [2021-11-06 21:51:20,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394476,394489] [2021-11-06 21:51:20,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394619,394632] [2021-11-06 21:51:20,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394763,394776] [2021-11-06 21:51:20,282 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[394904,394917] [2021-11-06 21:51:20,283 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395042,395055] [2021-11-06 21:51:20,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395200,395213] [2021-11-06 21:51:20,284 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395359,395372] [2021-11-06 21:51:20,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395515,395528] [2021-11-06 21:51:20,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395664,395677] [2021-11-06 21:51:20,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395816,395829] [2021-11-06 21:51:20,290 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[395967,395980] [2021-11-06 21:51:20,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396116,396129] [2021-11-06 21:51:20,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396268,396281] [2021-11-06 21:51:20,291 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396416,396429] [2021-11-06 21:51:20,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396569,396582] [2021-11-06 21:51:20,293 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396720,396733] [2021-11-06 21:51:20,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[396870,396883] [2021-11-06 21:51:20,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397017,397030] [2021-11-06 21:51:20,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397168,397181] [2021-11-06 21:51:20,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397319,397332] [2021-11-06 21:51:20,298 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397467,397480] [2021-11-06 21:51:20,299 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397633,397646] [2021-11-06 21:51:20,299 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397802,397815] [2021-11-06 21:51:20,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[397969,397982] [2021-11-06 21:51:20,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398137,398150] [2021-11-06 21:51:20,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398287,398300] [2021-11-06 21:51:20,300 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398434,398447] [2021-11-06 21:51:20,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398595,398608] [2021-11-06 21:51:20,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398765,398778] [2021-11-06 21:51:20,301 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i[398927,398940] [2021-11-06 21:51:20,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:51:20,448 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:51:20,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20 WrapperNode [2021-11-06 21:51:20,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:51:20,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:51:20,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:51:20,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:51:20,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:20,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:20,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:51:20,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:51:20,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:51:20,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:51:20,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:20,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:20,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:20,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:21,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:21,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:21,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:21,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:51:21,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:51:21,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:51:21,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:51:21,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (1/1) ... [2021-11-06 21:51:21,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:51:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:51:21,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 21:51:21,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 21:51:21,286 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 21:51:21,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:51:21,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:51:21,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:51:21,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:51:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:51:21,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:51:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:51:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:51:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-06 21:51:21,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:51:50,198 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L9169: #t~ret986 := main_#res; [2021-11-06 21:51:50,199 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-06 21:51:50,199 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:51:50,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:51:50,218 INFO L299 CfgBuilder]: Removed 3145 assume(true) statements. [2021-11-06 21:51:50,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:51:50 BoogieIcfgContainer [2021-11-06 21:51:50,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:51:50,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:51:50,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:51:50,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:51:50,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:51:17" (1/3) ... [2021-11-06 21:51:50,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3099609e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:51:50, skipping insertion in model container [2021-11-06 21:51:50,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:20" (2/3) ... [2021-11-06 21:51:50,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3099609e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:51:50, skipping insertion in model container [2021-11-06 21:51:50,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:51:50" (3/3) ... [2021-11-06 21:51:50,227 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--usb--kaweth.ko.cil.i [2021-11-06 21:51:50,230 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:51:50,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 209 error locations. [2021-11-06 21:51:50,265 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:51:50,268 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:51:50,269 INFO L340 AbstractCegarLoop]: Starting to check reachability of 209 error locations. [2021-11-06 21:51:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 3008 states, 2799 states have (on average 1.4219364058592354) internal successors, (3980), 3007 states have internal predecessors, (3980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 21:51:50,307 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:50,308 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 21:51:50,308 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1015889784, now seen corresponding path program 1 times [2021-11-06 21:51:50,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:50,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599990526] [2021-11-06 21:51:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:50,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:51,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:51,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599990526] [2021-11-06 21:51:51,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599990526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:51,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:51,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:51,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094669848] [2021-11-06 21:51:51,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:51,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:51,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:51,071 INFO L87 Difference]: Start difference. First operand has 3008 states, 2799 states have (on average 1.4219364058592354) internal successors, (3980), 3007 states have internal predecessors, (3980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 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 21:51:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:51,264 INFO L93 Difference]: Finished difference Result 5845 states and 7733 transitions. [2021-11-06 21:51:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:51,266 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 21:51:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:51,297 INFO L225 Difference]: With dead ends: 5845 [2021-11-06 21:51:51,297 INFO L226 Difference]: Without dead ends: 2836 [2021-11-06 21:51:51,306 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2021-11-06 21:51:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2836. [2021-11-06 21:51:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2836 states, 2629 states have (on average 1.292126283758083) internal successors, (3397), 2835 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 3397 transitions. [2021-11-06 21:51:51,439 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 3397 transitions. Word has length 29 [2021-11-06 21:51:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:51,440 INFO L470 AbstractCegarLoop]: Abstraction has 2836 states and 3397 transitions. [2021-11-06 21:51:51,440 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 21:51:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3397 transitions. [2021-11-06 21:51:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 21:51:51,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:51,442 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 21:51:51,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:51:51,443 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr168ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:51,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1312104596, now seen corresponding path program 1 times [2021-11-06 21:51:51,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:51,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712747010] [2021-11-06 21:51:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:51,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:51,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:51,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712747010] [2021-11-06 21:51:51,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712747010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:51,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:51,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:51,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710417580] [2021-11-06 21:51:51,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:51,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:51,719 INFO L87 Difference]: Start difference. First operand 2836 states and 3397 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 21:51:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:51,804 INFO L93 Difference]: Finished difference Result 2836 states and 3397 transitions. [2021-11-06 21:51:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:51,805 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 21:51:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:51,813 INFO L225 Difference]: With dead ends: 2836 [2021-11-06 21:51:51,813 INFO L226 Difference]: Without dead ends: 2832 [2021-11-06 21:51:51,814 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2021-11-06 21:51:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2832. [2021-11-06 21:51:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2627 states have (on average 1.2915873620098972) internal successors, (3393), 2831 states have internal predecessors, (3393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3393 transitions. [2021-11-06 21:51:51,865 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3393 transitions. Word has length 31 [2021-11-06 21:51:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:51,865 INFO L470 AbstractCegarLoop]: Abstraction has 2832 states and 3393 transitions. [2021-11-06 21:51:51,866 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 21:51:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3393 transitions. [2021-11-06 21:51:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:51:51,867 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:51,867 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 21:51:51,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:51:51,867 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr169ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1788270256, now seen corresponding path program 1 times [2021-11-06 21:51:51,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:51,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78578087] [2021-11-06 21:51:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:51,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:52,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:52,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78578087] [2021-11-06 21:51:52,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78578087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:52,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:52,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:52,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094044162] [2021-11-06 21:51:52,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:52,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:52,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:52,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:52,127 INFO L87 Difference]: Start difference. First operand 2832 states and 3393 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 21:51:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:52,224 INFO L93 Difference]: Finished difference Result 2832 states and 3393 transitions. [2021-11-06 21:51:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:52,224 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 21:51:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:52,278 INFO L225 Difference]: With dead ends: 2832 [2021-11-06 21:51:52,280 INFO L226 Difference]: Without dead ends: 2828 [2021-11-06 21:51:52,280 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2021-11-06 21:51:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2828. [2021-11-06 21:51:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2625 states have (on average 1.291047619047619) internal successors, (3389), 2827 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3389 transitions. [2021-11-06 21:51:52,330 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3389 transitions. Word has length 33 [2021-11-06 21:51:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:52,331 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3389 transitions. [2021-11-06 21:51:52,331 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 21:51:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3389 transitions. [2021-11-06 21:51:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:51:52,336 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:52,336 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 21:51:52,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:51:52,336 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr170ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash 541199956, now seen corresponding path program 1 times [2021-11-06 21:51:52,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:52,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130762296] [2021-11-06 21:51:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:52,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:52,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:52,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130762296] [2021-11-06 21:51:52,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130762296] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:52,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:52,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:52,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162248235] [2021-11-06 21:51:52,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:52,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:52,614 INFO L87 Difference]: Start difference. First operand 2828 states and 3389 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 21:51:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:52,703 INFO L93 Difference]: Finished difference Result 2828 states and 3389 transitions. [2021-11-06 21:51:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:52,704 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 21:51:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:52,711 INFO L225 Difference]: With dead ends: 2828 [2021-11-06 21:51:52,712 INFO L226 Difference]: Without dead ends: 2824 [2021-11-06 21:51:52,712 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2021-11-06 21:51:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2824. [2021-11-06 21:51:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2623 states have (on average 1.2905070529927565) internal successors, (3385), 2823 states have internal predecessors, (3385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3385 transitions. [2021-11-06 21:51:52,765 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3385 transitions. Word has length 35 [2021-11-06 21:51:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:52,766 INFO L470 AbstractCegarLoop]: Abstraction has 2824 states and 3385 transitions. [2021-11-06 21:51:52,766 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 21:51:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3385 transitions. [2021-11-06 21:51:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:51:52,767 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:52,767 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 21:51:52,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:51:52,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr171ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 402517592, now seen corresponding path program 1 times [2021-11-06 21:51:52,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:52,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201485611] [2021-11-06 21:51:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:52,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:53,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:53,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201485611] [2021-11-06 21:51:53,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201485611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:53,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:53,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:53,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918241291] [2021-11-06 21:51:53,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:53,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:53,002 INFO L87 Difference]: Start difference. First operand 2824 states and 3385 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:53,085 INFO L93 Difference]: Finished difference Result 2824 states and 3385 transitions. [2021-11-06 21:51:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-06 21:51:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:53,094 INFO L225 Difference]: With dead ends: 2824 [2021-11-06 21:51:53,094 INFO L226 Difference]: Without dead ends: 2820 [2021-11-06 21:51:53,095 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2021-11-06 21:51:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2820. [2021-11-06 21:51:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2621 states have (on average 1.2899656619610835) internal successors, (3381), 2819 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3381 transitions. [2021-11-06 21:51:53,153 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3381 transitions. Word has length 37 [2021-11-06 21:51:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:53,154 INFO L470 AbstractCegarLoop]: Abstraction has 2820 states and 3381 transitions. [2021-11-06 21:51:53,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3381 transitions. [2021-11-06 21:51:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:51:53,155 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:53,155 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:53,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:51:53,155 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr172ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash 272752316, now seen corresponding path program 1 times [2021-11-06 21:51:53,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:53,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293151754] [2021-11-06 21:51:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:53,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:53,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:53,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293151754] [2021-11-06 21:51:53,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293151754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:53,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:53,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:53,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019928778] [2021-11-06 21:51:53,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:53,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:53,406 INFO L87 Difference]: Start difference. First operand 2820 states and 3381 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:53,490 INFO L93 Difference]: Finished difference Result 2820 states and 3381 transitions. [2021-11-06 21:51:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 21:51:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:53,498 INFO L225 Difference]: With dead ends: 2820 [2021-11-06 21:51:53,498 INFO L226 Difference]: Without dead ends: 2816 [2021-11-06 21:51:53,499 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2021-11-06 21:51:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2816. [2021-11-06 21:51:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2619 states have (on average 1.2894234440626193) internal successors, (3377), 2815 states have internal predecessors, (3377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 3377 transitions. [2021-11-06 21:51:53,558 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 3377 transitions. Word has length 39 [2021-11-06 21:51:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:53,558 INFO L470 AbstractCegarLoop]: Abstraction has 2816 states and 3377 transitions. [2021-11-06 21:51:53,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 3377 transitions. [2021-11-06 21:51:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:51:53,559 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:53,559 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:53,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:51:53,560 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr173ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:53,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash 122374016, now seen corresponding path program 1 times [2021-11-06 21:51:53,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:53,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944900527] [2021-11-06 21:51:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:53,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:53,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:53,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944900527] [2021-11-06 21:51:53,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944900527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:53,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:53,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:53,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265573494] [2021-11-06 21:51:53,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:53,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:53,770 INFO L87 Difference]: Start difference. First operand 2816 states and 3377 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:53,863 INFO L93 Difference]: Finished difference Result 2816 states and 3377 transitions. [2021-11-06 21:51:53,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:53,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 21:51:53,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:53,871 INFO L225 Difference]: With dead ends: 2816 [2021-11-06 21:51:53,871 INFO L226 Difference]: Without dead ends: 2812 [2021-11-06 21:51:53,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2021-11-06 21:51:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2021-11-06 21:51:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2617 states have (on average 1.288880397401605) internal successors, (3373), 2811 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 3373 transitions. [2021-11-06 21:51:53,933 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 3373 transitions. Word has length 41 [2021-11-06 21:51:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:53,933 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 3373 transitions. [2021-11-06 21:51:53,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3373 transitions. [2021-11-06 21:51:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:51:53,935 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:53,935 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:53,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:51:53,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr174ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1637716132, now seen corresponding path program 1 times [2021-11-06 21:51:53,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:53,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755047168] [2021-11-06 21:51:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:53,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:54,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:54,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755047168] [2021-11-06 21:51:54,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755047168] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:54,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:54,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:54,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897993595] [2021-11-06 21:51:54,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:54,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:54,202 INFO L87 Difference]: Start difference. First operand 2812 states and 3373 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:54,300 INFO L93 Difference]: Finished difference Result 2812 states and 3373 transitions. [2021-11-06 21:51:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 21:51:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:54,309 INFO L225 Difference]: With dead ends: 2812 [2021-11-06 21:51:54,310 INFO L226 Difference]: Without dead ends: 2808 [2021-11-06 21:51:54,311 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2021-11-06 21:51:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2808. [2021-11-06 21:51:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2615 states have (on average 1.2883365200764818) internal successors, (3369), 2807 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 3369 transitions. [2021-11-06 21:51:54,396 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 3369 transitions. Word has length 43 [2021-11-06 21:51:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:54,397 INFO L470 AbstractCegarLoop]: Abstraction has 2808 states and 3369 transitions. [2021-11-06 21:51:54,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 3369 transitions. [2021-11-06 21:51:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:51:54,398 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:54,398 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:54,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:51:54,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr175ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1887575623, now seen corresponding path program 1 times [2021-11-06 21:51:54,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:54,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020238542] [2021-11-06 21:51:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:54,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:54,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:54,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020238542] [2021-11-06 21:51:54,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020238542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:54,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:54,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:54,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221987561] [2021-11-06 21:51:54,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:54,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:54,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:54,621 INFO L87 Difference]: Start difference. First operand 2808 states and 3369 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:54,716 INFO L93 Difference]: Finished difference Result 2808 states and 3369 transitions. [2021-11-06 21:51:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 21:51:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:54,724 INFO L225 Difference]: With dead ends: 2808 [2021-11-06 21:51:54,724 INFO L226 Difference]: Without dead ends: 2804 [2021-11-06 21:51:54,725 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2021-11-06 21:51:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2804. [2021-11-06 21:51:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2613 states have (on average 1.28779181017987) internal successors, (3365), 2803 states have internal predecessors, (3365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3365 transitions. [2021-11-06 21:51:54,792 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3365 transitions. Word has length 45 [2021-11-06 21:51:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:54,792 INFO L470 AbstractCegarLoop]: Abstraction has 2804 states and 3365 transitions. [2021-11-06 21:51:54,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3365 transitions. [2021-11-06 21:51:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:51:54,793 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:54,793 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:54,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:51:54,793 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr176ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1484379211, now seen corresponding path program 1 times [2021-11-06 21:51:54,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:54,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452033727] [2021-11-06 21:51:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:54,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:55,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:55,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452033727] [2021-11-06 21:51:55,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452033727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:55,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:55,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:55,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158954602] [2021-11-06 21:51:55,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:55,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:55,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:55,087 INFO L87 Difference]: Start difference. First operand 2804 states and 3365 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:55,216 INFO L93 Difference]: Finished difference Result 2804 states and 3365 transitions. [2021-11-06 21:51:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:55,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-11-06 21:51:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:55,224 INFO L225 Difference]: With dead ends: 2804 [2021-11-06 21:51:55,224 INFO L226 Difference]: Without dead ends: 2800 [2021-11-06 21:51:55,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2021-11-06 21:51:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2800. [2021-11-06 21:51:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2611 states have (on average 1.2872462657985446) internal successors, (3361), 2799 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3361 transitions. [2021-11-06 21:51:55,322 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3361 transitions. Word has length 47 [2021-11-06 21:51:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:55,323 INFO L470 AbstractCegarLoop]: Abstraction has 2800 states and 3361 transitions. [2021-11-06 21:51:55,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3361 transitions. [2021-11-06 21:51:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:51:55,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:55,323 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:55,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:51:55,324 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr177ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash 559684271, now seen corresponding path program 1 times [2021-11-06 21:51:55,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:55,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870804014] [2021-11-06 21:51:55,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:55,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:55,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:55,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870804014] [2021-11-06 21:51:55,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870804014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:55,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:55,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:55,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907256746] [2021-11-06 21:51:55,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:55,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:55,540 INFO L87 Difference]: Start difference. First operand 2800 states and 3361 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:55,642 INFO L93 Difference]: Finished difference Result 2800 states and 3361 transitions. [2021-11-06 21:51:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-11-06 21:51:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:55,649 INFO L225 Difference]: With dead ends: 2800 [2021-11-06 21:51:55,649 INFO L226 Difference]: Without dead ends: 2796 [2021-11-06 21:51:55,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2021-11-06 21:51:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2796. [2021-11-06 21:51:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2609 states have (on average 1.286699885013415) internal successors, (3357), 2795 states have internal predecessors, (3357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3357 transitions. [2021-11-06 21:51:55,728 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3357 transitions. Word has length 49 [2021-11-06 21:51:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:55,729 INFO L470 AbstractCegarLoop]: Abstraction has 2796 states and 3357 transitions. [2021-11-06 21:51:55,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3357 transitions. [2021-11-06 21:51:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:51:55,729 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:55,730 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:55,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:51:55,730 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr178ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 986077555, now seen corresponding path program 1 times [2021-11-06 21:51:55,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:55,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764950721] [2021-11-06 21:51:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:55,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:55,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:55,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764950721] [2021-11-06 21:51:55,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764950721] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:55,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:55,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:55,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200177306] [2021-11-06 21:51:55,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:55,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:55,936 INFO L87 Difference]: Start difference. First operand 2796 states and 3357 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:56,058 INFO L93 Difference]: Finished difference Result 2796 states and 3357 transitions. [2021-11-06 21:51:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:56,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-06 21:51:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:56,072 INFO L225 Difference]: With dead ends: 2796 [2021-11-06 21:51:56,072 INFO L226 Difference]: Without dead ends: 2792 [2021-11-06 21:51:56,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2021-11-06 21:51:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2792. [2021-11-06 21:51:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2607 states have (on average 1.2861526658995013) internal successors, (3353), 2791 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3353 transitions. [2021-11-06 21:51:56,148 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3353 transitions. Word has length 51 [2021-11-06 21:51:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:56,149 INFO L470 AbstractCegarLoop]: Abstraction has 2792 states and 3353 transitions. [2021-11-06 21:51:56,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3353 transitions. [2021-11-06 21:51:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:51:56,150 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:56,150 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:56,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:51:56,150 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr179ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1566836585, now seen corresponding path program 1 times [2021-11-06 21:51:56,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:56,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325041914] [2021-11-06 21:51:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:56,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:56,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:56,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325041914] [2021-11-06 21:51:56,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325041914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:56,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:56,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:56,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926373596] [2021-11-06 21:51:56,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:56,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:56,364 INFO L87 Difference]: Start difference. First operand 2792 states and 3353 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:56,480 INFO L93 Difference]: Finished difference Result 2792 states and 3353 transitions. [2021-11-06 21:51:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-06 21:51:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:56,485 INFO L225 Difference]: With dead ends: 2792 [2021-11-06 21:51:56,486 INFO L226 Difference]: Without dead ends: 2788 [2021-11-06 21:51:56,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2021-11-06 21:51:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2788. [2021-11-06 21:51:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2788 states, 2605 states have (on average 1.2856046065259117) internal successors, (3349), 2787 states have internal predecessors, (3349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3349 transitions. [2021-11-06 21:51:56,568 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3349 transitions. Word has length 53 [2021-11-06 21:51:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:56,568 INFO L470 AbstractCegarLoop]: Abstraction has 2788 states and 3349 transitions. [2021-11-06 21:51:56,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3349 transitions. [2021-11-06 21:51:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:51:56,569 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:56,569 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:56,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:51:56,570 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr180ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:56,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1803968539, now seen corresponding path program 1 times [2021-11-06 21:51:56,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:56,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100004976] [2021-11-06 21:51:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:56,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:56,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:56,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100004976] [2021-11-06 21:51:56,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100004976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:56,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:56,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:56,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852552867] [2021-11-06 21:51:56,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:56,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:56,794 INFO L87 Difference]: Start difference. First operand 2788 states and 3349 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:56,931 INFO L93 Difference]: Finished difference Result 2788 states and 3349 transitions. [2021-11-06 21:51:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:56,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-11-06 21:51:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:56,936 INFO L225 Difference]: With dead ends: 2788 [2021-11-06 21:51:56,936 INFO L226 Difference]: Without dead ends: 2784 [2021-11-06 21:51:56,938 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2021-11-06 21:51:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2021-11-06 21:51:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2603 states have (on average 1.2850557049558202) internal successors, (3345), 2783 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3345 transitions. [2021-11-06 21:51:57,013 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3345 transitions. Word has length 55 [2021-11-06 21:51:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:57,013 INFO L470 AbstractCegarLoop]: Abstraction has 2784 states and 3345 transitions. [2021-11-06 21:51:57,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3345 transitions. [2021-11-06 21:51:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:51:57,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:57,014 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:57,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:51:57,014 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr181ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1552615425, now seen corresponding path program 1 times [2021-11-06 21:51:57,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:57,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714709706] [2021-11-06 21:51:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:57,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:57,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:57,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714709706] [2021-11-06 21:51:57,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714709706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:57,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:57,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:57,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129868171] [2021-11-06 21:51:57,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:57,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:57,271 INFO L87 Difference]: Start difference. First operand 2784 states and 3345 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:57,396 INFO L93 Difference]: Finished difference Result 2784 states and 3345 transitions. [2021-11-06 21:51:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-06 21:51:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:57,401 INFO L225 Difference]: With dead ends: 2784 [2021-11-06 21:51:57,401 INFO L226 Difference]: Without dead ends: 2780 [2021-11-06 21:51:57,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2021-11-06 21:51:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2780. [2021-11-06 21:51:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2601 states have (on average 1.2845059592464436) internal successors, (3341), 2779 states have internal predecessors, (3341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3341 transitions. [2021-11-06 21:51:57,482 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3341 transitions. Word has length 57 [2021-11-06 21:51:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:57,482 INFO L470 AbstractCegarLoop]: Abstraction has 2780 states and 3341 transitions. [2021-11-06 21:51:57,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3341 transitions. [2021-11-06 21:51:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:51:57,484 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:57,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:57,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:51:57,485 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr182ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1709365181, now seen corresponding path program 1 times [2021-11-06 21:51:57,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:57,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907623015] [2021-11-06 21:51:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:57,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:57,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:57,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907623015] [2021-11-06 21:51:57,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907623015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:57,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:57,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:57,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043065347] [2021-11-06 21:51:57,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:57,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:57,881 INFO L87 Difference]: Start difference. First operand 2780 states and 3341 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:58,002 INFO L93 Difference]: Finished difference Result 2780 states and 3341 transitions. [2021-11-06 21:51:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-11-06 21:51:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:58,008 INFO L225 Difference]: With dead ends: 2780 [2021-11-06 21:51:58,008 INFO L226 Difference]: Without dead ends: 2776 [2021-11-06 21:51:58,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-11-06 21:51:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2776. [2021-11-06 21:51:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 2599 states have (on average 1.283955367449019) internal successors, (3337), 2775 states have internal predecessors, (3337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3337 transitions. [2021-11-06 21:51:58,101 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3337 transitions. Word has length 59 [2021-11-06 21:51:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:58,101 INFO L470 AbstractCegarLoop]: Abstraction has 2776 states and 3337 transitions. [2021-11-06 21:51:58,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3337 transitions. [2021-11-06 21:51:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:51:58,104 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:58,104 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:58,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:51:58,104 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr183ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2022024985, now seen corresponding path program 1 times [2021-11-06 21:51:58,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:58,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796444373] [2021-11-06 21:51:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:58,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:58,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:58,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796444373] [2021-11-06 21:51:58,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796444373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:58,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:58,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:58,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943633528] [2021-11-06 21:51:58,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:58,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:58,320 INFO L87 Difference]: Start difference. First operand 2776 states and 3337 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:58,439 INFO L93 Difference]: Finished difference Result 2776 states and 3337 transitions. [2021-11-06 21:51:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-11-06 21:51:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:58,443 INFO L225 Difference]: With dead ends: 2776 [2021-11-06 21:51:58,443 INFO L226 Difference]: Without dead ends: 2772 [2021-11-06 21:51:58,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2021-11-06 21:51:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2772. [2021-11-06 21:51:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2597 states have (on average 1.2834039276087794) internal successors, (3333), 2771 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3333 transitions. [2021-11-06 21:51:58,568 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3333 transitions. Word has length 61 [2021-11-06 21:51:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:58,568 INFO L470 AbstractCegarLoop]: Abstraction has 2772 states and 3333 transitions. [2021-11-06 21:51:58,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3333 transitions. [2021-11-06 21:51:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:51:58,569 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:58,569 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:58,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:51:58,570 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr184ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:58,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1840385557, now seen corresponding path program 1 times [2021-11-06 21:51:58,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:58,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154246306] [2021-11-06 21:51:58,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:58,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:58,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:58,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154246306] [2021-11-06 21:51:58,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154246306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:58,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:58,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:58,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573663533] [2021-11-06 21:51:58,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:58,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:58,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:58,779 INFO L87 Difference]: Start difference. First operand 2772 states and 3333 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:58,894 INFO L93 Difference]: Finished difference Result 2772 states and 3333 transitions. [2021-11-06 21:51:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-06 21:51:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:58,898 INFO L225 Difference]: With dead ends: 2772 [2021-11-06 21:51:58,898 INFO L226 Difference]: Without dead ends: 2768 [2021-11-06 21:51:58,899 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2021-11-06 21:51:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2768. [2021-11-06 21:51:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2595 states have (on average 1.2828516377649326) internal successors, (3329), 2767 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3329 transitions. [2021-11-06 21:51:58,982 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3329 transitions. Word has length 63 [2021-11-06 21:51:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:58,982 INFO L470 AbstractCegarLoop]: Abstraction has 2768 states and 3329 transitions. [2021-11-06 21:51:58,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3329 transitions. [2021-11-06 21:51:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:51:58,983 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:58,983 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:58,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:51:58,984 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr185ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:58,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 916413263, now seen corresponding path program 1 times [2021-11-06 21:51:58,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:58,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148224333] [2021-11-06 21:51:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:58,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:59,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:59,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148224333] [2021-11-06 21:51:59,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148224333] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:59,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:59,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:59,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841595963] [2021-11-06 21:51:59,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:59,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:59,190 INFO L87 Difference]: Start difference. First operand 2768 states and 3329 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:59,521 INFO L93 Difference]: Finished difference Result 4215 states and 5041 transitions. [2021-11-06 21:51:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:59,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-11-06 21:51:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:59,530 INFO L225 Difference]: With dead ends: 4215 [2021-11-06 21:51:59,530 INFO L226 Difference]: Without dead ends: 4211 [2021-11-06 21:51:59,531 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2021-11-06 21:51:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 4013. [2021-11-06 21:51:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 3840 states have (on average 1.2822916666666666) internal successors, (4924), 4012 states have internal predecessors, (4924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 4924 transitions. [2021-11-06 21:51:59,674 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 4924 transitions. Word has length 65 [2021-11-06 21:51:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:59,674 INFO L470 AbstractCegarLoop]: Abstraction has 4013 states and 4924 transitions. [2021-11-06 21:51:59,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 4924 transitions. [2021-11-06 21:51:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:51:59,675 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:59,675 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:51:59,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:51:59,676 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr186ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:51:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 205258003, now seen corresponding path program 1 times [2021-11-06 21:51:59,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:59,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689524798] [2021-11-06 21:51:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:59,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:51:59,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:59,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689524798] [2021-11-06 21:51:59,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689524798] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:59,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:59,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:59,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396879937] [2021-11-06 21:51:59,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:59,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:59,881 INFO L87 Difference]: Start difference. First operand 4013 states and 4924 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:00,088 INFO L93 Difference]: Finished difference Result 4013 states and 4924 transitions. [2021-11-06 21:52:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:52:00,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-06 21:52:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:00,094 INFO L225 Difference]: With dead ends: 4013 [2021-11-06 21:52:00,094 INFO L226 Difference]: Without dead ends: 4009 [2021-11-06 21:52:00,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:52:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2021-11-06 21:52:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4009. [2021-11-06 21:52:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 3838 states have (on average 1.2819176654507556) internal successors, (4920), 4008 states have internal predecessors, (4920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 4920 transitions. [2021-11-06 21:52:00,234 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 4920 transitions. Word has length 67 [2021-11-06 21:52:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:00,235 INFO L470 AbstractCegarLoop]: Abstraction has 4009 states and 4920 transitions. [2021-11-06 21:52:00,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 4920 transitions. [2021-11-06 21:52:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:52:00,236 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:00,236 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:00,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:52:00,236 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr187ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -315146441, now seen corresponding path program 1 times [2021-11-06 21:52:00,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:00,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66717700] [2021-11-06 21:52:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:00,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:00,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:00,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66717700] [2021-11-06 21:52:00,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66717700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:00,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:00,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:00,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571853461] [2021-11-06 21:52:00,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:52:00,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:52:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:52:00,456 INFO L87 Difference]: Start difference. First operand 4009 states and 4920 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:01,586 INFO L93 Difference]: Finished difference Result 7787 states and 9565 transitions. [2021-11-06 21:52:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:52:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-06 21:52:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:01,597 INFO L225 Difference]: With dead ends: 7787 [2021-11-06 21:52:01,598 INFO L226 Difference]: Without dead ends: 7649 [2021-11-06 21:52:01,600 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:52:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2021-11-06 21:52:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7231. [2021-11-06 21:52:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7231 states, 7060 states have (on average 1.291501416430595) internal successors, (9118), 7230 states have internal predecessors, (9118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 9118 transitions. [2021-11-06 21:52:01,876 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 9118 transitions. Word has length 69 [2021-11-06 21:52:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:01,876 INFO L470 AbstractCegarLoop]: Abstraction has 7231 states and 9118 transitions. [2021-11-06 21:52:01,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 9118 transitions. [2021-11-06 21:52:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 21:52:01,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:01,877 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:01,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:52:01,877 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 320593294, now seen corresponding path program 1 times [2021-11-06 21:52:01,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:01,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867642226] [2021-11-06 21:52:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:01,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:02,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:02,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867642226] [2021-11-06 21:52:02,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867642226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:02,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:02,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:02,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524171131] [2021-11-06 21:52:02,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:52:02,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:52:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:52:02,137 INFO L87 Difference]: Start difference. First operand 7231 states and 9118 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:02,570 INFO L93 Difference]: Finished difference Result 12029 states and 15136 transitions. [2021-11-06 21:52:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:52:02,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-11-06 21:52:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:02,588 INFO L225 Difference]: With dead ends: 12029 [2021-11-06 21:52:02,588 INFO L226 Difference]: Without dead ends: 9043 [2021-11-06 21:52:02,596 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:52:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9043 states. [2021-11-06 21:52:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9043 to 8975. [2021-11-06 21:52:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8975 states, 8804 states have (on average 1.295320308950477) internal successors, (11404), 8974 states have internal predecessors, (11404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 11404 transitions. [2021-11-06 21:52:02,971 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 11404 transitions. Word has length 72 [2021-11-06 21:52:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:02,971 INFO L470 AbstractCegarLoop]: Abstraction has 8975 states and 11404 transitions. [2021-11-06 21:52:02,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 11404 transitions. [2021-11-06 21:52:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 21:52:02,972 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:02,972 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:02,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:52:02,972 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash -881730005, now seen corresponding path program 1 times [2021-11-06 21:52:02,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:02,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172183657] [2021-11-06 21:52:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:02,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:03,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:03,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172183657] [2021-11-06 21:52:03,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172183657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:03,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:03,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:52:03,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856119409] [2021-11-06 21:52:03,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:52:03,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:52:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:52:03,231 INFO L87 Difference]: Start difference. First operand 8975 states and 11404 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:03,826 INFO L93 Difference]: Finished difference Result 12057 states and 15156 transitions. [2021-11-06 21:52:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:52:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-06 21:52:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:03,843 INFO L225 Difference]: With dead ends: 12057 [2021-11-06 21:52:03,844 INFO L226 Difference]: Without dead ends: 9089 [2021-11-06 21:52:03,849 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:52:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2021-11-06 21:52:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 8969. [2021-11-06 21:52:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8799 states have (on average 1.2945789294237982) internal successors, (11391), 8968 states have internal predecessors, (11391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 11391 transitions. [2021-11-06 21:52:04,251 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 11391 transitions. Word has length 75 [2021-11-06 21:52:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:04,251 INFO L470 AbstractCegarLoop]: Abstraction has 8969 states and 11391 transitions. [2021-11-06 21:52:04,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 11391 transitions. [2021-11-06 21:52:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 21:52:04,252 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:04,252 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:04,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:52:04,253 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2070520521, now seen corresponding path program 1 times [2021-11-06 21:52:04,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:04,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991991166] [2021-11-06 21:52:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:04,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:04,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:04,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991991166] [2021-11-06 21:52:04,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991991166] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:04,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:04,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:52:04,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635818028] [2021-11-06 21:52:04,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:52:04,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:52:04,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:52:04,740 INFO L87 Difference]: Start difference. First operand 8969 states and 11391 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:05,574 INFO L93 Difference]: Finished difference Result 19317 states and 24408 transitions. [2021-11-06 21:52:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:52:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-11-06 21:52:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:05,596 INFO L225 Difference]: With dead ends: 19317 [2021-11-06 21:52:05,596 INFO L226 Difference]: Without dead ends: 10426 [2021-11-06 21:52:05,609 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:52:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2021-11-06 21:52:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 8972. [2021-11-06 21:52:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8972 states, 8802 states have (on average 1.294478527607362) internal successors, (11394), 8971 states have internal predecessors, (11394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 11394 transitions. [2021-11-06 21:52:06,137 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 11394 transitions. Word has length 90 [2021-11-06 21:52:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:06,137 INFO L470 AbstractCegarLoop]: Abstraction has 8972 states and 11394 transitions. [2021-11-06 21:52:06,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 11394 transitions. [2021-11-06 21:52:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-06 21:52:06,138 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:06,138 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:06,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:52:06,139 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1238873483, now seen corresponding path program 1 times [2021-11-06 21:52:06,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:06,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663317124] [2021-11-06 21:52:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:06,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:06,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:06,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663317124] [2021-11-06 21:52:06,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663317124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:06,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:06,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:52:06,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653719297] [2021-11-06 21:52:06,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:52:06,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:52:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:52:06,548 INFO L87 Difference]: Start difference. First operand 8972 states and 11394 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:07,068 INFO L93 Difference]: Finished difference Result 17853 states and 22686 transitions. [2021-11-06 21:52:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:52:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-11-06 21:52:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:07,088 INFO L225 Difference]: With dead ends: 17853 [2021-11-06 21:52:07,088 INFO L226 Difference]: Without dead ends: 8976 [2021-11-06 21:52:07,102 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:52:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8976 states. [2021-11-06 21:52:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8976 to 8974. [2021-11-06 21:52:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8804 states have (on average 1.2944116310767833) internal successors, (11396), 8973 states have internal predecessors, (11396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 11396 transitions. [2021-11-06 21:52:07,531 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 11396 transitions. Word has length 96 [2021-11-06 21:52:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:07,532 INFO L470 AbstractCegarLoop]: Abstraction has 8974 states and 11396 transitions. [2021-11-06 21:52:07,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 11396 transitions. [2021-11-06 21:52:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 21:52:07,533 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:07,533 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:07,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:52:07,533 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash -903561490, now seen corresponding path program 1 times [2021-11-06 21:52:07,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:07,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624681358] [2021-11-06 21:52:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:07,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:07,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:07,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624681358] [2021-11-06 21:52:07,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624681358] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:52:07,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792778623] [2021-11-06 21:52:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:07,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:52:07,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:52:07,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:52:07,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 21:52:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:09,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 4476 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-06 21:52:09,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:52:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 21:52:09,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792778623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:09,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 21:52:09,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-11-06 21:52:09,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247008369] [2021-11-06 21:52:09,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:52:09,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:09,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:52:09,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:52:09,661 INFO L87 Difference]: Start difference. First operand 8974 states and 11396 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:10,978 INFO L93 Difference]: Finished difference Result 17941 states and 22784 transitions. [2021-11-06 21:52:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:52:10,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 99 [2021-11-06 21:52:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:10,994 INFO L225 Difference]: With dead ends: 17941 [2021-11-06 21:52:10,994 INFO L226 Difference]: Without dead ends: 8974 [2021-11-06 21:52:11,007 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-06 21:52:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2021-11-06 21:52:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8974. [2021-11-06 21:52:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8804 states have (on average 1.2942980463425715) internal successors, (11395), 8973 states have internal predecessors, (11395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 11395 transitions. [2021-11-06 21:52:11,547 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 11395 transitions. Word has length 99 [2021-11-06 21:52:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:11,547 INFO L470 AbstractCegarLoop]: Abstraction has 8974 states and 11395 transitions. [2021-11-06 21:52:11,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 11395 transitions. [2021-11-06 21:52:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 21:52:11,548 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:11,548 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:52:11,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 21:52:11,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-06 21:52:11,760 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:52:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1787070480, now seen corresponding path program 1 times [2021-11-06 21:52:11,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:11,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893570704] [2021-11-06 21:52:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:11,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:52:12,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:12,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893570704] [2021-11-06 21:52:12,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893570704] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:52:12,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096037790] [2021-11-06 21:52:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:12,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:52:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:52:12,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:52:12,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 21:54:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:30,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 4474 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 21:54:30,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:54:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:54:30,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096037790] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:54:30,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:54:30,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-11-06 21:54:30,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474248717] [2021-11-06 21:54:30,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:54:30,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:54:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:54:30,535 INFO L87 Difference]: Start difference. First operand 8974 states and 11395 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:54:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:31,490 INFO L93 Difference]: Finished difference Result 17856 states and 22688 transitions. [2021-11-06 21:54:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:54:31,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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 99 [2021-11-06 21:54:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:31,509 INFO L225 Difference]: With dead ends: 17856 [2021-11-06 21:54:31,510 INFO L226 Difference]: Without dead ends: 8979 [2021-11-06 21:54:31,523 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:54:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8979 states. [2021-11-06 21:54:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8979 to 8977. [2021-11-06 21:54:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8977 states, 8807 states have (on average 1.2941977972067673) internal successors, (11398), 8976 states have internal predecessors, (11398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:54:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8977 states to 8977 states and 11398 transitions. [2021-11-06 21:54:32,059 INFO L78 Accepts]: Start accepts. Automaton has 8977 states and 11398 transitions. Word has length 99 [2021-11-06 21:54:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:32,059 INFO L470 AbstractCegarLoop]: Abstraction has 8977 states and 11398 transitions. [2021-11-06 21:54:32,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:54:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8977 states and 11398 transitions. [2021-11-06 21:54:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 21:54:32,060 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:32,060 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:54:32,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 21:54:32,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-06 21:54:32,283 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr138ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:54:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1460258606, now seen corresponding path program 1 times [2021-11-06 21:54:32,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:32,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664461782] [2021-11-06 21:54:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:32,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:54:32,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:32,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664461782] [2021-11-06 21:54:32,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664461782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:32,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:32,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:32,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876323333] [2021-11-06 21:54:32,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:32,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:32,537 INFO L87 Difference]: Start difference. First operand 8977 states and 11398 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:54:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:33,185 INFO L93 Difference]: Finished difference Result 11867 states and 15002 transitions. [2021-11-06 21:54:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:54:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-06 21:54:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:33,204 INFO L225 Difference]: With dead ends: 11867 [2021-11-06 21:54:33,204 INFO L226 Difference]: Without dead ends: 11857 [2021-11-06 21:54:33,208 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2021-11-06 21:54:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 8967. [2021-11-06 21:54:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8967 states, 8802 states have (on average 1.291638264030902) internal successors, (11369), 8966 states have internal predecessors, (11369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:54:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 11369 transitions. [2021-11-06 21:54:33,683 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 11369 transitions. Word has length 100 [2021-11-06 21:54:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:33,684 INFO L470 AbstractCegarLoop]: Abstraction has 8967 states and 11369 transitions. [2021-11-06 21:54:33,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:54:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 11369 transitions. [2021-11-06 21:54:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 21:54:33,685 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:33,685 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:54:33,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:54:33,685 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 21:54:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 268412521, now seen corresponding path program 2 times [2021-11-06 21:54:33,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:33,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661186176] [2021-11-06 21:54:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:33,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:54:34,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:34,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661186176] [2021-11-06 21:54:34,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661186176] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:54:34,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607122188] [2021-11-06 21:54:34,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 21:54:34,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:54:34,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:54:34,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 21:54:34,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 22:00:57,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 22:00:57,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 22:00:58,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 4465 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 22:00:58,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:00:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:00:59,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607122188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:00:59,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 22:00:59,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2021-11-06 22:00:59,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195282618] [2021-11-06 22:00:59,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:00:59,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:00:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:00:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 22:00:59,089 INFO L87 Difference]: Start difference. First operand 8967 states and 11369 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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:01:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:00,904 INFO L93 Difference]: Finished difference Result 18550 states and 23407 transitions. [2021-11-06 22:01:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 22:01:00,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 102 [2021-11-06 22:01:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:00,923 INFO L225 Difference]: With dead ends: 18550 [2021-11-06 22:01:00,923 INFO L226 Difference]: Without dead ends: 9709 [2021-11-06 22:01:00,938 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-06 22:01:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2021-11-06 22:01:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 8967. [2021-11-06 22:01:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8967 states, 8802 states have (on average 1.2676664394455806) internal successors, (11158), 8966 states have internal predecessors, (11158), 0 states have call successors, (0), 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:01:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 11158 transitions. [2021-11-06 22:01:01,480 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 11158 transitions. Word has length 102 [2021-11-06 22:01:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:01,480 INFO L470 AbstractCegarLoop]: Abstraction has 8967 states and 11158 transitions. [2021-11-06 22:01:01,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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:01:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 11158 transitions. [2021-11-06 22:01:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 22:01:01,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:01,481 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:01,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 22:01:01,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-06 22:01:01,699 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 22:01:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash 268472103, now seen corresponding path program 1 times [2021-11-06 22:01:01,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:01,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627680061] [2021-11-06 22:01:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:01,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:01:01,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:01,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627680061] [2021-11-06 22:01:01,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627680061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:01,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:01,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:01:01,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003623273] [2021-11-06 22:01:01,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:01,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:01,974 INFO L87 Difference]: Start difference. First operand 8967 states and 11158 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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:01:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:03,419 INFO L93 Difference]: Finished difference Result 9739 states and 12002 transitions. [2021-11-06 22:01:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:01:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 102 [2021-11-06 22:01:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:03,433 INFO L225 Difference]: With dead ends: 9739 [2021-11-06 22:01:03,433 INFO L226 Difference]: Without dead ends: 9621 [2021-11-06 22:01:03,436 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:01:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9621 states. [2021-11-06 22:01:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9621 to 8849. [2021-11-06 22:01:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8849 states, 8743 states have (on average 1.2453391284456137) internal successors, (10888), 8848 states have internal predecessors, (10888), 0 states have call successors, (0), 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:01:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8849 states to 8849 states and 10888 transitions. [2021-11-06 22:01:03,966 INFO L78 Accepts]: Start accepts. Automaton has 8849 states and 10888 transitions. Word has length 102 [2021-11-06 22:01:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:03,966 INFO L470 AbstractCegarLoop]: Abstraction has 8849 states and 10888 transitions. [2021-11-06 22:01:03,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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:01:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8849 states and 10888 transitions. [2021-11-06 22:01:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-06 22:01:03,967 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:03,967 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:03,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 22:01:03,968 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 22:01:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 827544736, now seen corresponding path program 1 times [2021-11-06 22:01:03,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:03,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534610384] [2021-11-06 22:01:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:03,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-06 22:01:04,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:04,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534610384] [2021-11-06 22:01:04,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534610384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:04,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:04,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 22:01:04,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528165200] [2021-11-06 22:01:04,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:01:04,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:04,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:01:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:01:04,229 INFO L87 Difference]: Start difference. First operand 8849 states and 10888 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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:01:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:05,004 INFO L93 Difference]: Finished difference Result 17235 states and 21142 transitions. [2021-11-06 22:01:05,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:01:05,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 105 [2021-11-06 22:01:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:05,018 INFO L225 Difference]: With dead ends: 17235 [2021-11-06 22:01:05,018 INFO L226 Difference]: Without dead ends: 8520 [2021-11-06 22:01:05,030 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:01:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8520 states. [2021-11-06 22:01:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8520 to 8520. [2021-11-06 22:01:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8520 states, 8473 states have (on average 1.2033518234391596) internal successors, (10196), 8519 states have internal predecessors, (10196), 0 states have call successors, (0), 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:01:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8520 states to 8520 states and 10196 transitions. [2021-11-06 22:01:05,545 INFO L78 Accepts]: Start accepts. Automaton has 8520 states and 10196 transitions. Word has length 105 [2021-11-06 22:01:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:05,545 INFO L470 AbstractCegarLoop]: Abstraction has 8520 states and 10196 transitions. [2021-11-06 22:01:05,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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:01:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8520 states and 10196 transitions. [2021-11-06 22:01:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-06 22:01:05,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:05,547 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:05,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 22:01:05,548 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 22:01:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash -683439146, now seen corresponding path program 1 times [2021-11-06 22:01:05,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:05,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130379248] [2021-11-06 22:01:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:05,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:05,794 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:01:05,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:05,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130379248] [2021-11-06 22:01:05,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130379248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:05,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:05,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:01:05,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501084058] [2021-11-06 22:01:05,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:01:05,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:01:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:01:05,795 INFO L87 Difference]: Start difference. First operand 8520 states and 10196 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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:01:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:08,953 INFO L93 Difference]: Finished difference Result 12710 states and 15222 transitions. [2021-11-06 22:01:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:01:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2021-11-06 22:01:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:08,969 INFO L225 Difference]: With dead ends: 12710 [2021-11-06 22:01:08,969 INFO L226 Difference]: Without dead ends: 12698 [2021-11-06 22:01:08,972 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:01:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12698 states. [2021-11-06 22:01:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12698 to 8508. [2021-11-06 22:01:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8508 states, 8467 states have (on average 1.1997165465926538) internal successors, (10158), 8507 states have internal predecessors, (10158), 0 states have call successors, (0), 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:01:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8508 states to 8508 states and 10158 transitions. [2021-11-06 22:01:09,490 INFO L78 Accepts]: Start accepts. Automaton has 8508 states and 10158 transitions. Word has length 106 [2021-11-06 22:01:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:09,490 INFO L470 AbstractCegarLoop]: Abstraction has 8508 states and 10158 transitions. [2021-11-06 22:01:09,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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:01:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8508 states and 10158 transitions. [2021-11-06 22:01:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-06 22:01:09,492 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:09,492 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:09,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 22:01:09,493 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr162ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 22:01:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1448406252, now seen corresponding path program 1 times [2021-11-06 22:01:09,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:09,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637124919] [2021-11-06 22:01:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:09,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:15,642 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:01:15,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:15,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637124919] [2021-11-06 22:01:15,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637124919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:15,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:15,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 22:01:15,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111507114] [2021-11-06 22:01:15,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 22:01:15,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 22:01:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:01:15,643 INFO L87 Difference]: Start difference. First operand 8508 states and 10158 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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:01:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:34,579 INFO L93 Difference]: Finished difference Result 23589 states and 27877 transitions. [2021-11-06 22:01:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 22:01:34,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2021-11-06 22:01:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:34,604 INFO L225 Difference]: With dead ends: 23589 [2021-11-06 22:01:34,605 INFO L226 Difference]: Without dead ends: 18691 [2021-11-06 22:01:34,614 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-06 22:01:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18691 states. [2021-11-06 22:01:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18691 to 8592. [2021-11-06 22:01:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8592 states, 8551 states have (on average 1.1977546485791135) internal successors, (10242), 8591 states have internal predecessors, (10242), 0 states have call successors, (0), 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:01:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8592 states to 8592 states and 10242 transitions. [2021-11-06 22:01:35,230 INFO L78 Accepts]: Start accepts. Automaton has 8592 states and 10242 transitions. Word has length 119 [2021-11-06 22:01:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:35,231 INFO L470 AbstractCegarLoop]: Abstraction has 8592 states and 10242 transitions. [2021-11-06 22:01:35,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 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:01:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8592 states and 10242 transitions. [2021-11-06 22:01:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-06 22:01:35,232 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:35,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:35,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 22:01:35,232 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr162ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 22:01:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -427337898, now seen corresponding path program 1 times [2021-11-06 22:01:35,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:35,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141022830] [2021-11-06 22:01:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:35,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:01:41,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:41,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141022830] [2021-11-06 22:01:41,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141022830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:01:41,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:01:41,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 22:01:41,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816019017] [2021-11-06 22:01:41,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 22:01:41,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:01:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 22:01:41,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-06 22:01:41,032 INFO L87 Difference]: Start difference. First operand 8592 states and 10242 transitions. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 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:01:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:01:43,110 INFO L93 Difference]: Finished difference Result 9956 states and 11791 transitions. [2021-11-06 22:01:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 22:01:43,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2021-11-06 22:01:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:01:43,122 INFO L225 Difference]: With dead ends: 9956 [2021-11-06 22:01:43,122 INFO L226 Difference]: Without dead ends: 8589 [2021-11-06 22:01:43,126 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-11-06 22:01:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2021-11-06 22:01:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 8589. [2021-11-06 22:01:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8589 states, 8548 states have (on average 1.1975900795507721) internal successors, (10237), 8588 states have internal predecessors, (10237), 0 states have call successors, (0), 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:01:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 10237 transitions. [2021-11-06 22:01:43,742 INFO L78 Accepts]: Start accepts. Automaton has 8589 states and 10237 transitions. Word has length 119 [2021-11-06 22:01:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:01:43,742 INFO L470 AbstractCegarLoop]: Abstraction has 8589 states and 10237 transitions. [2021-11-06 22:01:43,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 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:01:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8589 states and 10237 transitions. [2021-11-06 22:01:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-06 22:01:43,744 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:01:43,744 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:43,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 22:01:43,745 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 206 more)] === [2021-11-06 22:01:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:01:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash -845625199, now seen corresponding path program 1 times [2021-11-06 22:01:43,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:01:43,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897697748] [2021-11-06 22:01:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:43,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:01:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:01:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:01:44,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:01:44,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897697748] [2021-11-06 22:01:44,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897697748] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 22:01:44,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679777778] [2021-11-06 22:01:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:01:44,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:01:44,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:01:44,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:01:44,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Killed by 15