./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--wireless--ath--ar5523--ar5523.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--wireless--ath--ar5523--ar5523.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 d25a5fddccc283f641b7212d7cb4f798f6892ab426c5d600c12492c2922640af --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:51:19,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:51:19,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:51:20,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:51:20,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:51:20,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:51:20,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:51:20,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:51:20,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:51:20,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:51:20,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:51:20,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:51:20,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:51:20,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:51:20,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:51:20,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:51:20,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:51:20,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:51:20,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:51:20,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:51:20,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:51:20,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:51:20,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:51:20,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:51:20,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:51:20,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:51:20,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:51:20,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:51:20,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:51:20,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:51:20,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:51:20,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:51:20,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:51:20,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:51:20,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:51:20,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:51:20,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:51:20,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:51:20,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:51:20,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:51:20,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:51:20,056 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:20,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:51:20,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:51:20,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:51:20,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:51:20,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:51:20,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:51:20,081 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:51:20,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:51:20,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:51:20,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:51:20,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:51:20,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:51:20,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:51:20,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:51:20,083 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:51:20,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:51:20,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:51:20,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:51:20,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:51:20,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:51:20,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:51:20,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:51:20,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:51:20,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:51:20,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:51:20,084 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:51:20,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:51:20,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:51:20,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:51:20,085 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 -> d25a5fddccc283f641b7212d7cb4f798f6892ab426c5d600c12492c2922640af [2021-11-06 21:51:20,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:51:20,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:51:20,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:51:20,306 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:51:20,307 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:51:20,308 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--wireless--ath--ar5523--ar5523.ko.cil.i [2021-11-06 21:51:20,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b289c73/a89a29e7b7d243fb857b5dfb033e0ed6/FLAGa46f09686 [2021-11-06 21:51:21,024 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:51:21,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i [2021-11-06 21:51:21,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b289c73/a89a29e7b7d243fb857b5dfb033e0ed6/FLAGa46f09686 [2021-11-06 21:51:21,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b289c73/a89a29e7b7d243fb857b5dfb033e0ed6 [2021-11-06 21:51:21,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:51:21,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:51:21,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:51:21,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:51:21,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:51:21,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:51:21" (1/1) ... [2021-11-06 21:51:21,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bdf22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:21, skipping insertion in model container [2021-11-06 21:51:21,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:51:21" (1/1) ... [2021-11-06 21:51:21,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:51:21,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:51:24,737 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491154,491167] [2021-11-06 21:51:24,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491299,491312] [2021-11-06 21:51:24,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491445,491458] [2021-11-06 21:51:24,740 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491610,491623] [2021-11-06 21:51:24,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491768,491781] [2021-11-06 21:51:24,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491926,491939] [2021-11-06 21:51:24,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492084,492097] [2021-11-06 21:51:24,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492244,492257] [2021-11-06 21:51:24,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492403,492416] [2021-11-06 21:51:24,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492542,492555] [2021-11-06 21:51:24,743 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492684,492697] [2021-11-06 21:51:24,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492833,492846] [2021-11-06 21:51:24,744 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492972,492985] [2021-11-06 21:51:24,746 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493127,493140] [2021-11-06 21:51:24,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493287,493300] [2021-11-06 21:51:24,747 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493438,493451] [2021-11-06 21:51:24,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493589,493602] [2021-11-06 21:51:24,751 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493741,493754] [2021-11-06 21:51:24,752 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493890,493903] [2021-11-06 21:51:24,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494038,494051] [2021-11-06 21:51:24,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494195,494208] [2021-11-06 21:51:24,753 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494344,494357] [2021-11-06 21:51:24,754 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494500,494513] [2021-11-06 21:51:24,754 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494653,494666] [2021-11-06 21:51:24,754 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494799,494812] [2021-11-06 21:51:24,758 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494942,494955] [2021-11-06 21:51:24,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495094,495107] [2021-11-06 21:51:24,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495240,495253] [2021-11-06 21:51:24,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495385,495398] [2021-11-06 21:51:24,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495539,495552] [2021-11-06 21:51:24,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495690,495703] [2021-11-06 21:51:24,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495845,495858] [2021-11-06 21:51:24,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495997,496010] [2021-11-06 21:51:24,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496152,496165] [2021-11-06 21:51:24,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496316,496329] [2021-11-06 21:51:24,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496472,496485] [2021-11-06 21:51:24,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496636,496649] [2021-11-06 21:51:24,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496778,496791] [2021-11-06 21:51:24,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496936,496949] [2021-11-06 21:51:24,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497103,497116] [2021-11-06 21:51:24,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497262,497275] [2021-11-06 21:51:24,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497421,497434] [2021-11-06 21:51:24,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497570,497583] [2021-11-06 21:51:24,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497717,497730] [2021-11-06 21:51:24,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497856,497869] [2021-11-06 21:51:24,765 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498019,498032] [2021-11-06 21:51:24,765 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498185,498198] [2021-11-06 21:51:24,765 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498349,498362] [2021-11-06 21:51:24,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498514,498527] [2021-11-06 21:51:24,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498679,498692] [2021-11-06 21:51:24,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498845,498858] [2021-11-06 21:51:24,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499010,499023] [2021-11-06 21:51:24,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499177,499190] [2021-11-06 21:51:24,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499337,499350] [2021-11-06 21:51:24,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499499,499512] [2021-11-06 21:51:24,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499658,499671] [2021-11-06 21:51:24,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499804,499817] [2021-11-06 21:51:24,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499947,499960] [2021-11-06 21:51:24,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500091,500104] [2021-11-06 21:51:24,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500234,500247] [2021-11-06 21:51:24,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500378,500391] [2021-11-06 21:51:24,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500519,500532] [2021-11-06 21:51:24,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500657,500670] [2021-11-06 21:51:24,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500815,500828] [2021-11-06 21:51:24,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500974,500987] [2021-11-06 21:51:24,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501130,501143] [2021-11-06 21:51:24,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501279,501292] [2021-11-06 21:51:24,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501431,501444] [2021-11-06 21:51:24,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501582,501595] [2021-11-06 21:51:24,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501731,501744] [2021-11-06 21:51:24,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501883,501896] [2021-11-06 21:51:24,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502031,502044] [2021-11-06 21:51:24,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502184,502197] [2021-11-06 21:51:24,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502335,502348] [2021-11-06 21:51:24,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502485,502498] [2021-11-06 21:51:24,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502632,502645] [2021-11-06 21:51:24,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502783,502796] [2021-11-06 21:51:24,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502934,502947] [2021-11-06 21:51:24,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503082,503095] [2021-11-06 21:51:24,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503248,503261] [2021-11-06 21:51:24,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503417,503430] [2021-11-06 21:51:24,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503584,503597] [2021-11-06 21:51:24,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503752,503765] [2021-11-06 21:51:24,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503902,503915] [2021-11-06 21:51:24,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504049,504062] [2021-11-06 21:51:24,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504210,504223] [2021-11-06 21:51:24,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504380,504393] [2021-11-06 21:51:24,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504542,504555] [2021-11-06 21:51:24,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:51:24,836 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:51:25,124 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491154,491167] [2021-11-06 21:51:25,125 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491299,491312] [2021-11-06 21:51:25,125 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491445,491458] [2021-11-06 21:51:25,126 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491610,491623] [2021-11-06 21:51:25,126 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491768,491781] [2021-11-06 21:51:25,127 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491926,491939] [2021-11-06 21:51:25,127 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492084,492097] [2021-11-06 21:51:25,128 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492244,492257] [2021-11-06 21:51:25,128 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492403,492416] [2021-11-06 21:51:25,129 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492542,492555] [2021-11-06 21:51:25,129 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492684,492697] [2021-11-06 21:51:25,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492833,492846] [2021-11-06 21:51:25,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492972,492985] [2021-11-06 21:51:25,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493127,493140] [2021-11-06 21:51:25,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493287,493300] [2021-11-06 21:51:25,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493438,493451] [2021-11-06 21:51:25,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493589,493602] [2021-11-06 21:51:25,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493741,493754] [2021-11-06 21:51:25,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493890,493903] [2021-11-06 21:51:25,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494038,494051] [2021-11-06 21:51:25,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494195,494208] [2021-11-06 21:51:25,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494344,494357] [2021-11-06 21:51:25,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494500,494513] [2021-11-06 21:51:25,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494653,494666] [2021-11-06 21:51:25,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494799,494812] [2021-11-06 21:51:25,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494942,494955] [2021-11-06 21:51:25,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495094,495107] [2021-11-06 21:51:25,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495240,495253] [2021-11-06 21:51:25,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495385,495398] [2021-11-06 21:51:25,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495539,495552] [2021-11-06 21:51:25,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495690,495703] [2021-11-06 21:51:25,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495845,495858] [2021-11-06 21:51:25,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495997,496010] [2021-11-06 21:51:25,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496152,496165] [2021-11-06 21:51:25,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496316,496329] [2021-11-06 21:51:25,137 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496472,496485] [2021-11-06 21:51:25,137 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496636,496649] [2021-11-06 21:51:25,137 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496778,496791] [2021-11-06 21:51:25,137 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496936,496949] [2021-11-06 21:51:25,138 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497103,497116] [2021-11-06 21:51:25,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497262,497275] [2021-11-06 21:51:25,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497421,497434] [2021-11-06 21:51:25,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497570,497583] [2021-11-06 21:51:25,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497717,497730] [2021-11-06 21:51:25,140 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497856,497869] [2021-11-06 21:51:25,140 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498019,498032] [2021-11-06 21:51:25,140 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498185,498198] [2021-11-06 21:51:25,140 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498349,498362] [2021-11-06 21:51:25,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498514,498527] [2021-11-06 21:51:25,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498679,498692] [2021-11-06 21:51:25,141 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498845,498858] [2021-11-06 21:51:25,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499010,499023] [2021-11-06 21:51:25,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499177,499190] [2021-11-06 21:51:25,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499337,499350] [2021-11-06 21:51:25,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499499,499512] [2021-11-06 21:51:25,143 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499658,499671] [2021-11-06 21:51:25,143 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499804,499817] [2021-11-06 21:51:25,144 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499947,499960] [2021-11-06 21:51:25,144 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500091,500104] [2021-11-06 21:51:25,147 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500234,500247] [2021-11-06 21:51:25,147 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500378,500391] [2021-11-06 21:51:25,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500519,500532] [2021-11-06 21:51:25,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500657,500670] [2021-11-06 21:51:25,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500815,500828] [2021-11-06 21:51:25,149 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500974,500987] [2021-11-06 21:51:25,151 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501130,501143] [2021-11-06 21:51:25,151 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501279,501292] [2021-11-06 21:51:25,152 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501431,501444] [2021-11-06 21:51:25,152 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501582,501595] [2021-11-06 21:51:25,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501731,501744] [2021-11-06 21:51:25,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501883,501896] [2021-11-06 21:51:25,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502031,502044] [2021-11-06 21:51:25,153 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502184,502197] [2021-11-06 21:51:25,154 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502335,502348] [2021-11-06 21:51:25,157 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502485,502498] [2021-11-06 21:51:25,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502632,502645] [2021-11-06 21:51:25,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502783,502796] [2021-11-06 21:51:25,158 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502934,502947] [2021-11-06 21:51:25,159 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503082,503095] [2021-11-06 21:51:25,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503248,503261] [2021-11-06 21:51:25,162 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503417,503430] [2021-11-06 21:51:25,163 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503584,503597] [2021-11-06 21:51:25,163 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503752,503765] [2021-11-06 21:51:25,163 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503902,503915] [2021-11-06 21:51:25,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504049,504062] [2021-11-06 21:51:25,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504210,504223] [2021-11-06 21:51:25,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504380,504393] [2021-11-06 21:51:25,164 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504542,504555] [2021-11-06 21:51:25,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:51:25,304 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:51:25,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:25 WrapperNode [2021-11-06 21:51:25,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:51:25,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:51:25,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:51:25,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:51:25,310 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:25" (1/1) ... [2021-11-06 21:51:25,396 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:25" (1/1) ... [2021-11-06 21:51:26,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:51:26,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:51:26,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:51:26,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:51:26,853 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:25" (1/1) ... [2021-11-06 21:51:26,853 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:25" (1/1) ... [2021-11-06 21:51:27,198 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:25" (1/1) ... [2021-11-06 21:51:27,199 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:25" (1/1) ... [2021-11-06 21:51:28,377 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:25" (1/1) ... [2021-11-06 21:51:28,824 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:25" (1/1) ... [2021-11-06 21:51:28,943 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:25" (1/1) ... [2021-11-06 21:51:29,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:51:29,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:51:29,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:51:29,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:51:29,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:25" (1/1) ... [2021-11-06 21:51:29,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:51:29,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:51:29,268 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:29,275 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:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:51:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:51:29,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:51:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:51:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:51:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:51:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-06 21:51:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:54:12,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-06 21:54:12,516 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:54:12,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L12223: #t~ret1613 := main_#res; [2021-11-06 21:54:12,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:54:12,547 INFO L299 CfgBuilder]: Removed 11043 assume(true) statements. [2021-11-06 21:54:12,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:12 BoogieIcfgContainer [2021-11-06 21:54:12,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:54:12,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:54:12,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:54:12,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:54:12,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:51:21" (1/3) ... [2021-11-06 21:54:12,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f62bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:12, skipping insertion in model container [2021-11-06 21:54:12,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:25" (2/3) ... [2021-11-06 21:54:12,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f62bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:12, skipping insertion in model container [2021-11-06 21:54:12,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:12" (3/3) ... [2021-11-06 21:54:12,560 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i [2021-11-06 21:54:12,563 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:54:12,564 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2021-11-06 21:54:12,611 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:54:12,616 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:54:12,616 INFO L340 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2021-11-06 21:54:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 10829 states, 10181 states have (on average 1.3895491602003733) internal successors, (14147), 10828 states have internal predecessors, (14147), 0 states have call successors, (0), 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:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 21:54:12,734 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:12,734 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:54:12,734 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr606ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash 805190088, now seen corresponding path program 1 times [2021-11-06 21:54:12,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:12,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552111893] [2021-11-06 21:54:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:12,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:13,683 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:13,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:13,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552111893] [2021-11-06 21:54:13,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552111893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:13,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:13,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:13,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105925832] [2021-11-06 21:54:13,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:13,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:13,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:13,715 INFO L87 Difference]: Start difference. First operand has 10829 states, 10181 states have (on average 1.3895491602003733) internal successors, (14147), 10828 states have internal predecessors, (14147), 0 states have call successors, (0), 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:54:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:14,063 INFO L93 Difference]: Finished difference Result 21515 states and 28112 transitions. [2021-11-06 21:54:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:14,065 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:54:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:14,115 INFO L225 Difference]: With dead ends: 21515 [2021-11-06 21:54:14,115 INFO L226 Difference]: Without dead ends: 10694 [2021-11-06 21:54:14,139 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2021-11-06 21:54:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 10694. [2021-11-06 21:54:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10694 states, 10048 states have (on average 1.316779458598726) internal successors, (13231), 10693 states have internal predecessors, (13231), 0 states have call successors, (0), 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:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10694 states to 10694 states and 13231 transitions. [2021-11-06 21:54:14,410 INFO L78 Accepts]: Start accepts. Automaton has 10694 states and 13231 transitions. Word has length 29 [2021-11-06 21:54:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:14,414 INFO L470 AbstractCegarLoop]: Abstraction has 10694 states and 13231 transitions. [2021-11-06 21:54:14,415 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:54:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10694 states and 13231 transitions. [2021-11-06 21:54:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 21:54:14,416 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:14,416 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:54:14,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:54:14,417 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr607ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 694712524, now seen corresponding path program 1 times [2021-11-06 21:54:14,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:14,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484669470] [2021-11-06 21:54:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:14,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:14,938 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:14,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:14,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484669470] [2021-11-06 21:54:14,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484669470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:14,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:14,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:14,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247055532] [2021-11-06 21:54:14,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:14,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:14,940 INFO L87 Difference]: Start difference. First operand 10694 states and 13231 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:54:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:15,180 INFO L93 Difference]: Finished difference Result 10694 states and 13231 transitions. [2021-11-06 21:54:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:15,180 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:54:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:15,210 INFO L225 Difference]: With dead ends: 10694 [2021-11-06 21:54:15,210 INFO L226 Difference]: Without dead ends: 10690 [2021-11-06 21:54:15,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10690 states. [2021-11-06 21:54:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10690 to 10690. [2021-11-06 21:54:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10690 states, 10046 states have (on average 1.316643440175194) internal successors, (13227), 10689 states have internal predecessors, (13227), 0 states have call successors, (0), 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:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10690 states to 10690 states and 13227 transitions. [2021-11-06 21:54:15,775 INFO L78 Accepts]: Start accepts. Automaton has 10690 states and 13227 transitions. Word has length 31 [2021-11-06 21:54:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:15,775 INFO L470 AbstractCegarLoop]: Abstraction has 10690 states and 13227 transitions. [2021-11-06 21:54:15,775 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:54:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 10690 states and 13227 transitions. [2021-11-06 21:54:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:54:15,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:15,777 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:54:15,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:54:15,777 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr608ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:15,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1899956272, now seen corresponding path program 1 times [2021-11-06 21:54:15,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:15,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392669181] [2021-11-06 21:54:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:15,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:16,507 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:16,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:16,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392669181] [2021-11-06 21:54:16,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392669181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:16,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:16,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:16,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441207938] [2021-11-06 21:54:16,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:16,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:16,509 INFO L87 Difference]: Start difference. First operand 10690 states and 13227 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:54:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:16,782 INFO L93 Difference]: Finished difference Result 10690 states and 13227 transitions. [2021-11-06 21:54:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:16,783 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:54:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:16,823 INFO L225 Difference]: With dead ends: 10690 [2021-11-06 21:54:16,823 INFO L226 Difference]: Without dead ends: 10686 [2021-11-06 21:54:16,828 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10686 states. [2021-11-06 21:54:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10686 to 10686. [2021-11-06 21:54:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10686 states, 10044 states have (on average 1.3165073675826364) internal successors, (13223), 10685 states have internal predecessors, (13223), 0 states have call successors, (0), 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:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10686 states to 10686 states and 13223 transitions. [2021-11-06 21:54:17,147 INFO L78 Accepts]: Start accepts. Automaton has 10686 states and 13223 transitions. Word has length 33 [2021-11-06 21:54:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:17,148 INFO L470 AbstractCegarLoop]: Abstraction has 10686 states and 13223 transitions. [2021-11-06 21:54:17,148 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:54:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 10686 states and 13223 transitions. [2021-11-06 21:54:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:54:17,153 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:17,153 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:54:17,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:54:17,154 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr609ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash 498028532, now seen corresponding path program 1 times [2021-11-06 21:54:17,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:17,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541223041] [2021-11-06 21:54:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:17,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:17,614 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:17,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:17,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541223041] [2021-11-06 21:54:17,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541223041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:17,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:17,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:17,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568616809] [2021-11-06 21:54:17,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:17,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:17,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:17,615 INFO L87 Difference]: Start difference. First operand 10686 states and 13223 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:54:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:17,870 INFO L93 Difference]: Finished difference Result 10686 states and 13223 transitions. [2021-11-06 21:54:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:17,870 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:54:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:17,891 INFO L225 Difference]: With dead ends: 10686 [2021-11-06 21:54:17,892 INFO L226 Difference]: Without dead ends: 10682 [2021-11-06 21:54:17,899 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10682 states. [2021-11-06 21:54:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10682 to 10682. [2021-11-06 21:54:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10682 states, 10042 states have (on average 1.3163712407886876) internal successors, (13219), 10681 states have internal predecessors, (13219), 0 states have call successors, (0), 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:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 13219 transitions. [2021-11-06 21:54:18,158 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 13219 transitions. Word has length 35 [2021-11-06 21:54:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:18,158 INFO L470 AbstractCegarLoop]: Abstraction has 10682 states and 13219 transitions. [2021-11-06 21:54:18,158 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:54:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 13219 transitions. [2021-11-06 21:54:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:54:18,159 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:18,159 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:54:18,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:54:18,159 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr610ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:18,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1865201688, now seen corresponding path program 1 times [2021-11-06 21:54:18,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:18,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141743289] [2021-11-06 21:54:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:18,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:18,605 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:18,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:18,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141743289] [2021-11-06 21:54:18,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141743289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:18,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:18,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:18,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368568144] [2021-11-06 21:54:18,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:18,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:18,606 INFO L87 Difference]: Start difference. First operand 10682 states and 13219 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:54:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:18,912 INFO L93 Difference]: Finished difference Result 10682 states and 13219 transitions. [2021-11-06 21:54:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:18,913 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:54:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:18,931 INFO L225 Difference]: With dead ends: 10682 [2021-11-06 21:54:18,932 INFO L226 Difference]: Without dead ends: 10678 [2021-11-06 21:54:18,935 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10678 states. [2021-11-06 21:54:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10678 to 10678. [2021-11-06 21:54:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10678 states, 10040 states have (on average 1.3162350597609562) internal successors, (13215), 10677 states have internal predecessors, (13215), 0 states have call successors, (0), 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:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10678 states to 10678 states and 13215 transitions. [2021-11-06 21:54:19,145 INFO L78 Accepts]: Start accepts. Automaton has 10678 states and 13215 transitions. Word has length 37 [2021-11-06 21:54:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:19,146 INFO L470 AbstractCegarLoop]: Abstraction has 10678 states and 13215 transitions. [2021-11-06 21:54:19,146 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:54:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10678 states and 13215 transitions. [2021-11-06 21:54:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:54:19,148 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:19,148 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:54:19,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:54:19,148 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr611ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1458612380, now seen corresponding path program 1 times [2021-11-06 21:54:19,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:19,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260845800] [2021-11-06 21:54:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:19,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:19,597 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:19,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:19,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260845800] [2021-11-06 21:54:19,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260845800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:19,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:19,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:19,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813762181] [2021-11-06 21:54:19,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:19,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:19,598 INFO L87 Difference]: Start difference. First operand 10678 states and 13215 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:54:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:19,861 INFO L93 Difference]: Finished difference Result 10678 states and 13215 transitions. [2021-11-06 21:54:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:19,862 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:54:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:19,883 INFO L225 Difference]: With dead ends: 10678 [2021-11-06 21:54:19,883 INFO L226 Difference]: Without dead ends: 10674 [2021-11-06 21:54:19,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2021-11-06 21:54:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10674. [2021-11-06 21:54:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10674 states, 10038 states have (on average 1.3160988244670253) internal successors, (13211), 10673 states have internal predecessors, (13211), 0 states have call successors, (0), 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:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 13211 transitions. [2021-11-06 21:54:20,164 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 13211 transitions. Word has length 39 [2021-11-06 21:54:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:20,164 INFO L470 AbstractCegarLoop]: Abstraction has 10674 states and 13211 transitions. [2021-11-06 21:54:20,164 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:54:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 13211 transitions. [2021-11-06 21:54:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:54:20,165 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:20,165 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:54:20,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:54:20,165 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr612ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1568311680, now seen corresponding path program 1 times [2021-11-06 21:54:20,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:20,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882528960] [2021-11-06 21:54:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:20,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:20,596 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:20,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:20,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882528960] [2021-11-06 21:54:20,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882528960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:20,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:20,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:20,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418345331] [2021-11-06 21:54:20,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:20,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:20,598 INFO L87 Difference]: Start difference. First operand 10674 states and 13211 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:54:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:20,844 INFO L93 Difference]: Finished difference Result 10674 states and 13211 transitions. [2021-11-06 21:54:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:20,845 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:54:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:20,864 INFO L225 Difference]: With dead ends: 10674 [2021-11-06 21:54:20,864 INFO L226 Difference]: Without dead ends: 10670 [2021-11-06 21:54:20,868 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2021-11-06 21:54:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 10670. [2021-11-06 21:54:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10670 states, 10036 states have (on average 1.315962534874452) internal successors, (13207), 10669 states have internal predecessors, (13207), 0 states have call successors, (0), 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:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 13207 transitions. [2021-11-06 21:54:21,089 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 13207 transitions. Word has length 41 [2021-11-06 21:54:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:21,089 INFO L470 AbstractCegarLoop]: Abstraction has 10670 states and 13207 transitions. [2021-11-06 21:54:21,090 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:54:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 13207 transitions. [2021-11-06 21:54:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:54:21,091 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:21,091 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:54:21,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:54:21,092 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr613ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash -384843068, now seen corresponding path program 1 times [2021-11-06 21:54:21,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:21,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547833991] [2021-11-06 21:54:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:21,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:21,586 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:21,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:21,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547833991] [2021-11-06 21:54:21,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547833991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:21,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:21,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:21,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389205837] [2021-11-06 21:54:21,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:21,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:21,587 INFO L87 Difference]: Start difference. First operand 10670 states and 13207 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:54:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:21,844 INFO L93 Difference]: Finished difference Result 10670 states and 13207 transitions. [2021-11-06 21:54:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:21,845 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:54:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:21,869 INFO L225 Difference]: With dead ends: 10670 [2021-11-06 21:54:21,869 INFO L226 Difference]: Without dead ends: 10666 [2021-11-06 21:54:21,874 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2021-11-06 21:54:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 10666. [2021-11-06 21:54:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10666 states, 10034 states have (on average 1.3158261909507674) internal successors, (13203), 10665 states have internal predecessors, (13203), 0 states have call successors, (0), 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:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10666 states to 10666 states and 13203 transitions. [2021-11-06 21:54:22,095 INFO L78 Accepts]: Start accepts. Automaton has 10666 states and 13203 transitions. Word has length 43 [2021-11-06 21:54:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:22,095 INFO L470 AbstractCegarLoop]: Abstraction has 10666 states and 13203 transitions. [2021-11-06 21:54:22,095 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:54:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10666 states and 13203 transitions. [2021-11-06 21:54:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:54:22,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:22,096 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:54:22,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:54:22,096 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr614ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash -465848185, now seen corresponding path program 1 times [2021-11-06 21:54:22,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:22,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51940325] [2021-11-06 21:54:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:22,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:22,529 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:22,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:22,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51940325] [2021-11-06 21:54:22,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51940325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:22,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:22,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:22,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668381233] [2021-11-06 21:54:22,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:22,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:22,530 INFO L87 Difference]: Start difference. First operand 10666 states and 13203 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:54:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:22,851 INFO L93 Difference]: Finished difference Result 10666 states and 13203 transitions. [2021-11-06 21:54:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:22,851 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:54:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:22,872 INFO L225 Difference]: With dead ends: 10666 [2021-11-06 21:54:22,872 INFO L226 Difference]: Without dead ends: 10662 [2021-11-06 21:54:22,875 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2021-11-06 21:54:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 10662. [2021-11-06 21:54:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10662 states, 10032 states have (on average 1.315689792663477) internal successors, (13199), 10661 states have internal predecessors, (13199), 0 states have call successors, (0), 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:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10662 states to 10662 states and 13199 transitions. [2021-11-06 21:54:23,095 INFO L78 Accepts]: Start accepts. Automaton has 10662 states and 13199 transitions. Word has length 45 [2021-11-06 21:54:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:23,096 INFO L470 AbstractCegarLoop]: Abstraction has 10662 states and 13199 transitions. [2021-11-06 21:54:23,096 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:54:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10662 states and 13199 transitions. [2021-11-06 21:54:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:54:23,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:23,096 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:54:23,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:54:23,097 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr615ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1002352981, now seen corresponding path program 1 times [2021-11-06 21:54:23,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:23,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838492106] [2021-11-06 21:54:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:23,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:23,488 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:23,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:23,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838492106] [2021-11-06 21:54:23,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838492106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:23,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:23,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:23,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913532638] [2021-11-06 21:54:23,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:23,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:23,489 INFO L87 Difference]: Start difference. First operand 10662 states and 13199 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:54:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:23,754 INFO L93 Difference]: Finished difference Result 10662 states and 13199 transitions. [2021-11-06 21:54:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:23,755 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:54:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:23,767 INFO L225 Difference]: With dead ends: 10662 [2021-11-06 21:54:23,768 INFO L226 Difference]: Without dead ends: 10658 [2021-11-06 21:54:23,770 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10658 states. [2021-11-06 21:54:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10658 to 10658. [2021-11-06 21:54:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10658 states, 10030 states have (on average 1.3155533399800599) internal successors, (13195), 10657 states have internal predecessors, (13195), 0 states have call successors, (0), 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:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10658 states to 10658 states and 13195 transitions. [2021-11-06 21:54:23,992 INFO L78 Accepts]: Start accepts. Automaton has 10658 states and 13195 transitions. Word has length 47 [2021-11-06 21:54:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:23,992 INFO L470 AbstractCegarLoop]: Abstraction has 10658 states and 13195 transitions. [2021-11-06 21:54:23,992 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:54:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10658 states and 13195 transitions. [2021-11-06 21:54:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:54:23,993 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:23,993 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:54:23,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:54:23,993 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr616ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1187386065, now seen corresponding path program 1 times [2021-11-06 21:54:23,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:23,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016380406] [2021-11-06 21:54:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:23,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:54:24,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:24,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016380406] [2021-11-06 21:54:24,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016380406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:24,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:24,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:24,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122303986] [2021-11-06 21:54:24,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:24,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:24,427 INFO L87 Difference]: Start difference. First operand 10658 states and 13195 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:54:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:24,704 INFO L93 Difference]: Finished difference Result 10658 states and 13195 transitions. [2021-11-06 21:54:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:24,705 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:54:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:24,716 INFO L225 Difference]: With dead ends: 10658 [2021-11-06 21:54:24,716 INFO L226 Difference]: Without dead ends: 10654 [2021-11-06 21:54:24,719 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10654 states. [2021-11-06 21:54:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10654 to 10654. [2021-11-06 21:54:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10654 states, 10028 states have (on average 1.3154168328679696) internal successors, (13191), 10653 states have internal predecessors, (13191), 0 states have call successors, (0), 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:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10654 states to 10654 states and 13191 transitions. [2021-11-06 21:54:24,955 INFO L78 Accepts]: Start accepts. Automaton has 10654 states and 13191 transitions. Word has length 49 [2021-11-06 21:54:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:24,956 INFO L470 AbstractCegarLoop]: Abstraction has 10654 states and 13191 transitions. [2021-11-06 21:54:24,956 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:54:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 10654 states and 13191 transitions. [2021-11-06 21:54:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:54:24,956 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:24,957 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:54:24,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:54:24,957 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr617ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1384446995, now seen corresponding path program 1 times [2021-11-06 21:54:24,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:24,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116296940] [2021-11-06 21:54:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:24,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:25,342 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:25,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:25,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116296940] [2021-11-06 21:54:25,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116296940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:25,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:25,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:25,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594172454] [2021-11-06 21:54:25,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:25,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:25,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:25,344 INFO L87 Difference]: Start difference. First operand 10654 states and 13191 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:54:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:25,634 INFO L93 Difference]: Finished difference Result 10654 states and 13191 transitions. [2021-11-06 21:54:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:25,635 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:54:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:25,646 INFO L225 Difference]: With dead ends: 10654 [2021-11-06 21:54:25,646 INFO L226 Difference]: Without dead ends: 10650 [2021-11-06 21:54:25,659 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10650 states. [2021-11-06 21:54:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10650 to 10650. [2021-11-06 21:54:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10650 states, 10026 states have (on average 1.3152802712946339) internal successors, (13187), 10649 states have internal predecessors, (13187), 0 states have call successors, (0), 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:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10650 states to 10650 states and 13187 transitions. [2021-11-06 21:54:25,897 INFO L78 Accepts]: Start accepts. Automaton has 10650 states and 13187 transitions. Word has length 51 [2021-11-06 21:54:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:25,897 INFO L470 AbstractCegarLoop]: Abstraction has 10650 states and 13187 transitions. [2021-11-06 21:54:25,897 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:54:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 10650 states and 13187 transitions. [2021-11-06 21:54:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:54:25,898 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:25,898 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:54:25,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:54:25,898 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr618ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash -985144489, now seen corresponding path program 1 times [2021-11-06 21:54:25,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:25,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347571927] [2021-11-06 21:54:25,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:25,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:26,346 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:26,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:26,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347571927] [2021-11-06 21:54:26,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347571927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:26,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:26,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:26,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173536147] [2021-11-06 21:54:26,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:26,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:26,347 INFO L87 Difference]: Start difference. First operand 10650 states and 13187 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:54:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:26,681 INFO L93 Difference]: Finished difference Result 10650 states and 13187 transitions. [2021-11-06 21:54:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:26,681 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:54:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:26,692 INFO L225 Difference]: With dead ends: 10650 [2021-11-06 21:54:26,693 INFO L226 Difference]: Without dead ends: 10646 [2021-11-06 21:54:26,695 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2021-11-06 21:54:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10646. [2021-11-06 21:54:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10646 states, 10024 states have (on average 1.315143655227454) internal successors, (13183), 10645 states have internal predecessors, (13183), 0 states have call successors, (0), 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:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10646 states to 10646 states and 13183 transitions. [2021-11-06 21:54:26,939 INFO L78 Accepts]: Start accepts. Automaton has 10646 states and 13183 transitions. Word has length 53 [2021-11-06 21:54:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:26,939 INFO L470 AbstractCegarLoop]: Abstraction has 10646 states and 13183 transitions. [2021-11-06 21:54:26,940 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:54:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 10646 states and 13183 transitions. [2021-11-06 21:54:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:54:26,940 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:26,940 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:54:26,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:54:26,940 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr619ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1829893381, now seen corresponding path program 1 times [2021-11-06 21:54:26,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:26,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241402949] [2021-11-06 21:54:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:26,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:27,350 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:27,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:27,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241402949] [2021-11-06 21:54:27,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241402949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:27,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:27,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:27,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129255319] [2021-11-06 21:54:27,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:27,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:27,351 INFO L87 Difference]: Start difference. First operand 10646 states and 13183 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:54:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:27,654 INFO L93 Difference]: Finished difference Result 10646 states and 13183 transitions. [2021-11-06 21:54:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:27,654 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:54:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:27,665 INFO L225 Difference]: With dead ends: 10646 [2021-11-06 21:54:27,665 INFO L226 Difference]: Without dead ends: 10642 [2021-11-06 21:54:27,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10642 states. [2021-11-06 21:54:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10642 to 10642. [2021-11-06 21:54:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10642 states, 10022 states have (on average 1.3150069846338057) internal successors, (13179), 10641 states have internal predecessors, (13179), 0 states have call successors, (0), 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:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10642 states to 10642 states and 13179 transitions. [2021-11-06 21:54:27,909 INFO L78 Accepts]: Start accepts. Automaton has 10642 states and 13179 transitions. Word has length 55 [2021-11-06 21:54:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:27,909 INFO L470 AbstractCegarLoop]: Abstraction has 10642 states and 13179 transitions. [2021-11-06 21:54:27,909 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:54:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10642 states and 13179 transitions. [2021-11-06 21:54:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:54:27,909 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:27,910 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:54:27,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:54:27,910 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -172652523, now seen corresponding path program 1 times [2021-11-06 21:54:27,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:27,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257698720] [2021-11-06 21:54:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:27,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:28,410 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:28,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:28,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257698720] [2021-11-06 21:54:28,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257698720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:28,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:28,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:54:28,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705537620] [2021-11-06 21:54:28,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:28,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:28,412 INFO L87 Difference]: Start difference. First operand 10642 states and 13179 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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:54:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:39,683 INFO L93 Difference]: Finished difference Result 21268 states and 26209 transitions. [2021-11-06 21:54:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:54:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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:54:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:39,709 INFO L225 Difference]: With dead ends: 21268 [2021-11-06 21:54:39,709 INFO L226 Difference]: Without dead ends: 20902 [2021-11-06 21:54:39,716 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2021-11-06 21:54:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 11008. [2021-11-06 21:54:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11008 states, 10388 states have (on average 1.3039083557951483) internal successors, (13545), 11007 states have internal predecessors, (13545), 0 states have call successors, (0), 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:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11008 states to 11008 states and 13545 transitions. [2021-11-06 21:54:40,142 INFO L78 Accepts]: Start accepts. Automaton has 11008 states and 13545 transitions. Word has length 57 [2021-11-06 21:54:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:40,142 INFO L470 AbstractCegarLoop]: Abstraction has 11008 states and 13545 transitions. [2021-11-06 21:54:40,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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:54:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 11008 states and 13545 transitions. [2021-11-06 21:54:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:54:40,144 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:40,144 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:54:40,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:54:40,145 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:40,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash -172712105, now seen corresponding path program 1 times [2021-11-06 21:54:40,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:40,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898636074] [2021-11-06 21:54:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:40,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:41,027 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:41,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:41,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898636074] [2021-11-06 21:54:41,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898636074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:41,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:41,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:54:41,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772426591] [2021-11-06 21:54:41,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:54:41,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:54:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:41,029 INFO L87 Difference]: Start difference. First operand 11008 states and 13545 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 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:54:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:47,256 INFO L93 Difference]: Finished difference Result 21606 states and 26723 transitions. [2021-11-06 21:54:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:54:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 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:54:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:47,272 INFO L225 Difference]: With dead ends: 21606 [2021-11-06 21:54:47,272 INFO L226 Difference]: Without dead ends: 10707 [2021-11-06 21:54:47,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:54:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10707 states. [2021-11-06 21:54:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10707 to 10276. [2021-11-06 21:54:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10276 states, 9839 states have (on average 1.2836670393332656) internal successors, (12630), 10275 states have internal predecessors, (12630), 0 states have call successors, (0), 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:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10276 states to 10276 states and 12630 transitions. [2021-11-06 21:54:47,736 INFO L78 Accepts]: Start accepts. Automaton has 10276 states and 12630 transitions. Word has length 57 [2021-11-06 21:54:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:47,736 INFO L470 AbstractCegarLoop]: Abstraction has 10276 states and 12630 transitions. [2021-11-06 21:54:47,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 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:54:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 10276 states and 12630 transitions. [2021-11-06 21:54:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:54:47,737 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:47,737 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:54:47,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:54:47,738 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr620ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1884759297, now seen corresponding path program 1 times [2021-11-06 21:54:47,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:47,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426288777] [2021-11-06 21:54:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:47,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:48,215 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:48,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:48,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426288777] [2021-11-06 21:54:48,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426288777] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:48,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:48,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:48,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539824940] [2021-11-06 21:54:48,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:48,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:48,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:48,216 INFO L87 Difference]: Start difference. First operand 10276 states and 12630 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:54:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:48,683 INFO L93 Difference]: Finished difference Result 10276 states and 12630 transitions. [2021-11-06 21:54:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:48,684 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:54:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:48,698 INFO L225 Difference]: With dead ends: 10276 [2021-11-06 21:54:48,698 INFO L226 Difference]: Without dead ends: 10272 [2021-11-06 21:54:48,702 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2021-11-06 21:54:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 10272. [2021-11-06 21:54:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 9837 states have (on average 1.2835213988004472) internal successors, (12626), 10271 states have internal predecessors, (12626), 0 states have call successors, (0), 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:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 12626 transitions. [2021-11-06 21:54:49,099 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 12626 transitions. Word has length 57 [2021-11-06 21:54:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:49,099 INFO L470 AbstractCegarLoop]: Abstraction has 10272 states and 12626 transitions. [2021-11-06 21:54:49,099 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:54:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 12626 transitions. [2021-11-06 21:54:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:54:49,100 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:49,100 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] [2021-11-06 21:54:49,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:54:49,101 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr373ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:49,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash -794578107, now seen corresponding path program 1 times [2021-11-06 21:54:49,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:49,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872572217] [2021-11-06 21:54:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:49,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:49,449 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:49,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:49,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872572217] [2021-11-06 21:54:49,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872572217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:49,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:49,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:49,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471280048] [2021-11-06 21:54:49,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:54:49,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:54:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:54:49,450 INFO L87 Difference]: Start difference. First operand 10272 states and 12626 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:49,952 INFO L93 Difference]: Finished difference Result 14156 states and 17400 transitions. [2021-11-06 21:54:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:54:49,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-11-06 21:54:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:49,967 INFO L225 Difference]: With dead ends: 14156 [2021-11-06 21:54:49,968 INFO L226 Difference]: Without dead ends: 10269 [2021-11-06 21:54:49,976 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:54:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10269 states. [2021-11-06 21:54:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10269 to 10269. [2021-11-06 21:54:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10269 states, 9835 states have (on average 1.2833756990340621) internal successors, (12622), 10268 states have internal predecessors, (12622), 0 states have call successors, (0), 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:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 12622 transitions. [2021-11-06 21:54:50,441 INFO L78 Accepts]: Start accepts. Automaton has 10269 states and 12622 transitions. Word has length 58 [2021-11-06 21:54:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:50,442 INFO L470 AbstractCegarLoop]: Abstraction has 10269 states and 12622 transitions. [2021-11-06 21:54:50,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 10269 states and 12622 transitions. [2021-11-06 21:54:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:54:50,442 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:50,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, 1, 1, 1, 1, 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:50,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:54:50,443 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr621ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1223670627, now seen corresponding path program 1 times [2021-11-06 21:54:50,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:50,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820295822] [2021-11-06 21:54:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:50,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:51,069 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:51,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:51,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820295822] [2021-11-06 21:54:51,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820295822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:51,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:51,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:51,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121651110] [2021-11-06 21:54:51,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:51,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:51,070 INFO L87 Difference]: Start difference. First operand 10269 states and 12622 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:54:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:51,518 INFO L93 Difference]: Finished difference Result 10269 states and 12622 transitions. [2021-11-06 21:54:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:51,519 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:54:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:51,533 INFO L225 Difference]: With dead ends: 10269 [2021-11-06 21:54:51,533 INFO L226 Difference]: Without dead ends: 10265 [2021-11-06 21:54:51,536 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2021-11-06 21:54:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 10265. [2021-11-06 21:54:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10265 states, 9833 states have (on average 1.283229939997966) internal successors, (12618), 10264 states have internal predecessors, (12618), 0 states have call successors, (0), 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:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10265 states to 10265 states and 12618 transitions. [2021-11-06 21:54:51,944 INFO L78 Accepts]: Start accepts. Automaton has 10265 states and 12618 transitions. Word has length 59 [2021-11-06 21:54:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:51,945 INFO L470 AbstractCegarLoop]: Abstraction has 10265 states and 12618 transitions. [2021-11-06 21:54:51,945 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:54:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 10265 states and 12618 transitions. [2021-11-06 21:54:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 21:54:51,946 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:51,946 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:54:51,946 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1883602282, now seen corresponding path program 1 times [2021-11-06 21:54:51,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:51,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579094606] [2021-11-06 21:54:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:51,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:54:52,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:52,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579094606] [2021-11-06 21:54:52,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579094606] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:52,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:52,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:54:52,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667300240] [2021-11-06 21:54:52,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:54:52,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:52,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:54:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:54:52,383 INFO L87 Difference]: Start difference. First operand 10265 states and 12618 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:54,224 INFO L93 Difference]: Finished difference Result 19870 states and 24566 transitions. [2021-11-06 21:54:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:54:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-11-06 21:54:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:54,236 INFO L225 Difference]: With dead ends: 19870 [2021-11-06 21:54:54,236 INFO L226 Difference]: Without dead ends: 9716 [2021-11-06 21:54:54,249 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 21:54:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9716 states. [2021-11-06 21:54:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9716 to 9716. [2021-11-06 21:54:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9716 states, 9467 states have (on average 1.2555191718601457) internal successors, (11886), 9715 states have internal predecessors, (11886), 0 states have call successors, (0), 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:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9716 states to 9716 states and 11886 transitions. [2021-11-06 21:54:54,642 INFO L78 Accepts]: Start accepts. Automaton has 9716 states and 11886 transitions. Word has length 60 [2021-11-06 21:54:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:54,642 INFO L470 AbstractCegarLoop]: Abstraction has 9716 states and 11886 transitions. [2021-11-06 21:54:54,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9716 states and 11886 transitions. [2021-11-06 21:54:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:54:54,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:54,643 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:54:54,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:54:54,643 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr374ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1367055251, now seen corresponding path program 1 times [2021-11-06 21:54:54,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:54,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55269975] [2021-11-06 21:54:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:54,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:55,094 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:55,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:55,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55269975] [2021-11-06 21:54:55,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55269975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:55,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:55,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:54:55,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163609587] [2021-11-06 21:54:55,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:54:55,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:54:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:55,096 INFO L87 Difference]: Start difference. First operand 9716 states and 11886 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:54:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:55,776 INFO L93 Difference]: Finished difference Result 13421 states and 16411 transitions. [2021-11-06 21:54:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:54:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:55,789 INFO L225 Difference]: With dead ends: 13421 [2021-11-06 21:54:55,789 INFO L226 Difference]: Without dead ends: 9760 [2021-11-06 21:54:55,795 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:54:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2021-11-06 21:54:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 9713. [2021-11-06 21:54:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9713 states, 9465 states have (on average 1.2553618594823033) internal successors, (11882), 9712 states have internal predecessors, (11882), 0 states have call successors, (0), 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:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9713 states to 9713 states and 11882 transitions. [2021-11-06 21:54:56,279 INFO L78 Accepts]: Start accepts. Automaton has 9713 states and 11882 transitions. Word has length 61 [2021-11-06 21:54:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:56,279 INFO L470 AbstractCegarLoop]: Abstraction has 9713 states and 11882 transitions. [2021-11-06 21:54:56,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:54:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9713 states and 11882 transitions. [2021-11-06 21:54:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:54:56,279 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:56,280 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:54:56,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:54:56,280 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr622ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash -872410073, now seen corresponding path program 1 times [2021-11-06 21:54:56,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:56,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54675319] [2021-11-06 21:54:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:56,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:56,672 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:56,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:56,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54675319] [2021-11-06 21:54:56,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54675319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:56,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:56,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:56,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700682035] [2021-11-06 21:54:56,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:56,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:56,673 INFO L87 Difference]: Start difference. First operand 9713 states and 11882 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:54:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:57,216 INFO L93 Difference]: Finished difference Result 9713 states and 11882 transitions. [2021-11-06 21:54:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:57,218 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:54:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:57,230 INFO L225 Difference]: With dead ends: 9713 [2021-11-06 21:54:57,231 INFO L226 Difference]: Without dead ends: 9709 [2021-11-06 21:54:57,233 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:54:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2021-11-06 21:54:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 9709. [2021-11-06 21:54:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9709 states, 9463 states have (on average 1.2552044806086864) internal successors, (11878), 9708 states have internal predecessors, (11878), 0 states have call successors, (0), 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:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9709 states to 9709 states and 11878 transitions. [2021-11-06 21:54:57,655 INFO L78 Accepts]: Start accepts. Automaton has 9709 states and 11878 transitions. Word has length 61 [2021-11-06 21:54:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:57,655 INFO L470 AbstractCegarLoop]: Abstraction has 9709 states and 11878 transitions. [2021-11-06 21:54:57,655 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:54:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 9709 states and 11878 transitions. [2021-11-06 21:54:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:54:57,656 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:57,656 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:54:57,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:54:57,657 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr623ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash -866300597, now seen corresponding path program 1 times [2021-11-06 21:54:57,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:57,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373175495] [2021-11-06 21:54:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:57,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:58,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:54:58,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:58,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373175495] [2021-11-06 21:54:58,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373175495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:58,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:58,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:58,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230106010] [2021-11-06 21:54:58,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:58,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:58,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:58,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:58,055 INFO L87 Difference]: Start difference. First operand 9709 states and 11878 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:54:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:54:58,578 INFO L93 Difference]: Finished difference Result 9709 states and 11878 transitions. [2021-11-06 21:54:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:54:58,578 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:54:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:54:58,589 INFO L225 Difference]: With dead ends: 9709 [2021-11-06 21:54:58,589 INFO L226 Difference]: Without dead ends: 9705 [2021-11-06 21:54:58,591 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:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2021-11-06 21:54:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 9705. [2021-11-06 21:54:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9705 states, 9461 states have (on average 1.255047035197125) internal successors, (11874), 9704 states have internal predecessors, (11874), 0 states have call successors, (0), 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:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9705 states to 9705 states and 11874 transitions. [2021-11-06 21:54:59,018 INFO L78 Accepts]: Start accepts. Automaton has 9705 states and 11874 transitions. Word has length 63 [2021-11-06 21:54:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:54:59,019 INFO L470 AbstractCegarLoop]: Abstraction has 9705 states and 11874 transitions. [2021-11-06 21:54:59,019 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:54:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 9705 states and 11874 transitions. [2021-11-06 21:54:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:54:59,019 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:54:59,019 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:54:59,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:54:59,020 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr624ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:54:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:54:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 709938895, now seen corresponding path program 1 times [2021-11-06 21:54:59,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:54:59,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745784848] [2021-11-06 21:54:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:54:59,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:54:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:54:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:54:59,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:54:59,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745784848] [2021-11-06 21:54:59,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745784848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:54:59,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:54:59,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:54:59,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569565617] [2021-11-06 21:54:59,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:54:59,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:54:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:54:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:54:59,427 INFO L87 Difference]: Start difference. First operand 9705 states and 11874 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:55:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:00,394 INFO L93 Difference]: Finished difference Result 15210 states and 18655 transitions. [2021-11-06 21:55:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:55:00,395 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:55:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:00,416 INFO L225 Difference]: With dead ends: 15210 [2021-11-06 21:55:00,416 INFO L226 Difference]: Without dead ends: 15206 [2021-11-06 21:55:00,422 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15206 states. [2021-11-06 21:55:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15206 to 14922. [2021-11-06 21:55:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14922 states, 14678 states have (on average 1.2600490530044965) internal successors, (18495), 14921 states have internal predecessors, (18495), 0 states have call successors, (0), 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:55:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14922 states to 14922 states and 18495 transitions. [2021-11-06 21:55:01,189 INFO L78 Accepts]: Start accepts. Automaton has 14922 states and 18495 transitions. Word has length 65 [2021-11-06 21:55:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:01,189 INFO L470 AbstractCegarLoop]: Abstraction has 14922 states and 18495 transitions. [2021-11-06 21:55:01,190 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:55:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 14922 states and 18495 transitions. [2021-11-06 21:55:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:55:01,190 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:01,190 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:55:01,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:55:01,190 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr625ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -647364429, now seen corresponding path program 1 times [2021-11-06 21:55:01,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:01,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801006270] [2021-11-06 21:55:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:01,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:55:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:55:01,556 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:55:01,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:55:01,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801006270] [2021-11-06 21:55:01,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801006270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:55:01,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:55:01,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:55:01,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303669] [2021-11-06 21:55:01,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:55:01,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:55:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:55:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:55:01,558 INFO L87 Difference]: Start difference. First operand 14922 states and 18495 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:55:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:02,281 INFO L93 Difference]: Finished difference Result 14922 states and 18495 transitions. [2021-11-06 21:55:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:55:02,281 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:55:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:02,302 INFO L225 Difference]: With dead ends: 14922 [2021-11-06 21:55:02,302 INFO L226 Difference]: Without dead ends: 14918 [2021-11-06 21:55:02,307 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14918 states. [2021-11-06 21:55:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14918 to 14918. [2021-11-06 21:55:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14918 states, 14676 states have (on average 1.2599482147724175) internal successors, (18491), 14917 states have internal predecessors, (18491), 0 states have call successors, (0), 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:55:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14918 states to 14918 states and 18491 transitions. [2021-11-06 21:55:03,101 INFO L78 Accepts]: Start accepts. Automaton has 14918 states and 18491 transitions. Word has length 67 [2021-11-06 21:55:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:03,103 INFO L470 AbstractCegarLoop]: Abstraction has 14918 states and 18491 transitions. [2021-11-06 21:55:03,104 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:55:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14918 states and 18491 transitions. [2021-11-06 21:55:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:55:03,104 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:03,105 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:55:03,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:55:03,105 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr626ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 654199543, now seen corresponding path program 1 times [2021-11-06 21:55:03,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:03,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791555321] [2021-11-06 21:55:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:03,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:55:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:55:03,479 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:55:03,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:55:03,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791555321] [2021-11-06 21:55:03,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791555321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:55:03,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:55:03,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:55:03,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481998668] [2021-11-06 21:55:03,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:55:03,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:55:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:55:03,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:55:03,480 INFO L87 Difference]: Start difference. First operand 14918 states and 18491 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:55:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:05,491 INFO L93 Difference]: Finished difference Result 29650 states and 36773 transitions. [2021-11-06 21:55:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:55:05,492 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:55:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:05,534 INFO L225 Difference]: With dead ends: 29650 [2021-11-06 21:55:05,534 INFO L226 Difference]: Without dead ends: 29531 [2021-11-06 21:55:05,545 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29531 states. [2021-11-06 21:55:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29531 to 29011. [2021-11-06 21:55:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29011 states, 28769 states have (on average 1.2635128089262748) internal successors, (36350), 29010 states have internal predecessors, (36350), 0 states have call successors, (0), 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:55:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29011 states to 29011 states and 36350 transitions. [2021-11-06 21:55:07,057 INFO L78 Accepts]: Start accepts. Automaton has 29011 states and 36350 transitions. Word has length 69 [2021-11-06 21:55:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:07,057 INFO L470 AbstractCegarLoop]: Abstraction has 29011 states and 36350 transitions. [2021-11-06 21:55:07,057 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:55:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 29011 states and 36350 transitions. [2021-11-06 21:55:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 21:55:07,058 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:07,058 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] [2021-11-06 21:55:07,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 21:55:07,058 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr375ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1066506622, now seen corresponding path program 1 times [2021-11-06 21:55:07,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:07,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666302037] [2021-11-06 21:55:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:07,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:55:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:55:07,735 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:55:07,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:55:07,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666302037] [2021-11-06 21:55:07,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666302037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:55:07,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:55:07,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:55:07,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064779435] [2021-11-06 21:55:07,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:55:07,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:55:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:55:07,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:55:07,736 INFO L87 Difference]: Start difference. First operand 29011 states and 36350 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:55:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:09,987 INFO L93 Difference]: Finished difference Result 37103 states and 46530 transitions. [2021-11-06 21:55:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:55:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-11-06 21:55:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:10,045 INFO L225 Difference]: With dead ends: 37103 [2021-11-06 21:55:10,046 INFO L226 Difference]: Without dead ends: 37083 [2021-11-06 21:55:10,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37083 states. [2021-11-06 21:55:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37083 to 28991. [2021-11-06 21:55:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28991 states, 28759 states have (on average 1.2627003720574428) internal successors, (36314), 28990 states have internal predecessors, (36314), 0 states have call successors, (0), 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:55:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28991 states to 28991 states and 36314 transitions. [2021-11-06 21:55:11,750 INFO L78 Accepts]: Start accepts. Automaton has 28991 states and 36314 transitions. Word has length 80 [2021-11-06 21:55:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:11,750 INFO L470 AbstractCegarLoop]: Abstraction has 28991 states and 36314 transitions. [2021-11-06 21:55:11,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:55:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28991 states and 36314 transitions. [2021-11-06 21:55:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 21:55:11,751 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:11,751 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] [2021-11-06 21:55:11,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 21:55:11,752 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr597ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 737309746, now seen corresponding path program 1 times [2021-11-06 21:55:11,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:11,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638200750] [2021-11-06 21:55:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:11,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:55:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:55:12,174 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:55:12,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:55:12,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638200750] [2021-11-06 21:55:12,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638200750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:55:12,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:55:12,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:55:12,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615513575] [2021-11-06 21:55:12,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:55:12,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:55:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:55:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:55:12,176 INFO L87 Difference]: Start difference. First operand 28991 states and 36314 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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:55:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:14,872 INFO L93 Difference]: Finished difference Result 49998 states and 62773 transitions. [2021-11-06 21:55:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:55:14,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-11-06 21:55:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:14,953 INFO L225 Difference]: With dead ends: 49998 [2021-11-06 21:55:14,953 INFO L226 Difference]: Without dead ends: 49992 [2021-11-06 21:55:14,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49992 states. [2021-11-06 21:55:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49992 to 28985. [2021-11-06 21:55:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28985 states, 28756 states have (on average 1.262449575740715) internal successors, (36303), 28984 states have internal predecessors, (36303), 0 states have call successors, (0), 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:55:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28985 states to 28985 states and 36303 transitions. [2021-11-06 21:55:16,853 INFO L78 Accepts]: Start accepts. Automaton has 28985 states and 36303 transitions. Word has length 84 [2021-11-06 21:55:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:16,853 INFO L470 AbstractCegarLoop]: Abstraction has 28985 states and 36303 transitions. [2021-11-06 21:55:16,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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:55:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 28985 states and 36303 transitions. [2021-11-06 21:55:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 21:55:16,854 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:16,854 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] [2021-11-06 21:55:16,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:55:16,855 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr598ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 767270173, now seen corresponding path program 1 times [2021-11-06 21:55:16,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:16,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477396762] [2021-11-06 21:55:16,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:16,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:55:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:55:17,242 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:55:17,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:55:17,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477396762] [2021-11-06 21:55:17,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477396762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:55:17,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:55:17,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:55:17,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147674912] [2021-11-06 21:55:17,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:55:17,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:55:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:55:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:55:17,243 INFO L87 Difference]: Start difference. First operand 28985 states and 36303 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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:55:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:22,590 INFO L93 Difference]: Finished difference Result 51149 states and 64186 transitions. [2021-11-06 21:55:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:55:22,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-11-06 21:55:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:22,684 INFO L225 Difference]: With dead ends: 51149 [2021-11-06 21:55:22,684 INFO L226 Difference]: Without dead ends: 51143 [2021-11-06 21:55:22,706 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51143 states. [2021-11-06 21:55:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51143 to 28979. [2021-11-06 21:55:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28979 states, 28753 states have (on average 1.262198727089347) internal successors, (36292), 28978 states have internal predecessors, (36292), 0 states have call successors, (0), 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:55:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28979 states to 28979 states and 36292 transitions. [2021-11-06 21:55:24,625 INFO L78 Accepts]: Start accepts. Automaton has 28979 states and 36292 transitions. Word has length 87 [2021-11-06 21:55:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:24,625 INFO L470 AbstractCegarLoop]: Abstraction has 28979 states and 36292 transitions. [2021-11-06 21:55:24,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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:55:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 28979 states and 36292 transitions. [2021-11-06 21:55:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 21:55:24,626 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:24,626 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] [2021-11-06 21:55:24,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 21:55:24,626 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr599ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 603064260, now seen corresponding path program 1 times [2021-11-06 21:55:24,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:24,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070719096] [2021-11-06 21:55:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:24,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:55:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:55:46,298 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:55:46,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:55:46,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070719096] [2021-11-06 21:55:46,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070719096] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:55:46,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:55:46,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:55:46,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635710791] [2021-11-06 21:55:46,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:55:46,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:55:46,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:55:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:55:46,299 INFO L87 Difference]: Start difference. First operand 28979 states and 36292 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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:55:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:55:49,912 INFO L93 Difference]: Finished difference Result 57951 states and 72576 transitions. [2021-11-06 21:55:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:55:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-06 21:55:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:55:49,955 INFO L225 Difference]: With dead ends: 57951 [2021-11-06 21:55:49,955 INFO L226 Difference]: Without dead ends: 28979 [2021-11-06 21:55:49,992 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:55:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28979 states. [2021-11-06 21:55:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28979 to 28979. [2021-11-06 21:55:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28979 states, 28753 states have (on average 1.2621639481097624) internal successors, (36291), 28978 states have internal predecessors, (36291), 0 states have call successors, (0), 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:55:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28979 states to 28979 states and 36291 transitions. [2021-11-06 21:55:51,772 INFO L78 Accepts]: Start accepts. Automaton has 28979 states and 36291 transitions. Word has length 94 [2021-11-06 21:55:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:55:51,772 INFO L470 AbstractCegarLoop]: Abstraction has 28979 states and 36291 transitions. [2021-11-06 21:55:51,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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:55:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 28979 states and 36291 transitions. [2021-11-06 21:55:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 21:55:51,773 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:55:51,773 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] [2021-11-06 21:55:51,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 21:55:51,774 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr599ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:55:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:55:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash -391629438, now seen corresponding path program 1 times [2021-11-06 21:55:51,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:55:51,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109657230] [2021-11-06 21:55:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:55:51,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:56:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:56:26,266 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:56:26,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:56:26,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109657230] [2021-11-06 21:56:26,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109657230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:56:26,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:56:26,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 21:56:26,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308767688] [2021-11-06 21:56:26,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 21:56:26,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:56:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 21:56:26,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:56:26,267 INFO L87 Difference]: Start difference. First operand 28979 states and 36291 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 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:56:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:56:31,482 INFO L93 Difference]: Finished difference Result 32944 states and 41105 transitions. [2021-11-06 21:56:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:56:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-06 21:56:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:56:31,522 INFO L225 Difference]: With dead ends: 32944 [2021-11-06 21:56:31,522 INFO L226 Difference]: Without dead ends: 28979 [2021-11-06 21:56:31,535 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-06 21:56:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28979 states. [2021-11-06 21:56:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28979 to 28979. [2021-11-06 21:56:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28979 states, 28753 states have (on average 1.2621291691301777) internal successors, (36290), 28978 states have internal predecessors, (36290), 0 states have call successors, (0), 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:56:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28979 states to 28979 states and 36290 transitions. [2021-11-06 21:56:33,286 INFO L78 Accepts]: Start accepts. Automaton has 28979 states and 36290 transitions. Word has length 94 [2021-11-06 21:56:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:56:33,286 INFO L470 AbstractCegarLoop]: Abstraction has 28979 states and 36290 transitions. [2021-11-06 21:56:33,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 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:56:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28979 states and 36290 transitions. [2021-11-06 21:56:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-06 21:56:33,288 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:56:33,288 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] [2021-11-06 21:56:33,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 21:56:33,288 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr599ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:56:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:56:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1429632230, now seen corresponding path program 1 times [2021-11-06 21:56:33,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:56:33,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378821860] [2021-11-06 21:56:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:56:33,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:57:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:57:07,524 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:57:07,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:57:07,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378821860] [2021-11-06 21:57:07,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378821860] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:57:07,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:57:07,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 21:57:07,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489810584] [2021-11-06 21:57:07,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 21:57:07,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:57:07,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 21:57:07,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:57:07,526 INFO L87 Difference]: Start difference. First operand 28979 states and 36290 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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:57:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:57:13,585 INFO L93 Difference]: Finished difference Result 40341 states and 50237 transitions. [2021-11-06 21:57:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 21:57:13,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2021-11-06 21:57:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:57:13,637 INFO L225 Difference]: With dead ends: 40341 [2021-11-06 21:57:13,637 INFO L226 Difference]: Without dead ends: 33071 [2021-11-06 21:57:13,654 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-11-06 21:57:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33071 states. [2021-11-06 21:57:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33071 to 28997. [2021-11-06 21:57:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28997 states, 28771 states have (on average 1.261860901602308) internal successors, (36305), 28996 states have internal predecessors, (36305), 0 states have call successors, (0), 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:57:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28997 states to 28997 states and 36305 transitions. [2021-11-06 21:57:15,451 INFO L78 Accepts]: Start accepts. Automaton has 28997 states and 36305 transitions. Word has length 104 [2021-11-06 21:57:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:57:15,451 INFO L470 AbstractCegarLoop]: Abstraction has 28997 states and 36305 transitions. [2021-11-06 21:57:15,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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:57:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 28997 states and 36305 transitions. [2021-11-06 21:57:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-06 21:57:15,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:57:15,453 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] [2021-11-06 21:57:15,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 21:57:15,453 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr599ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:57:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:57:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 646962792, now seen corresponding path program 1 times [2021-11-06 21:57:15,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:57:15,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38566129] [2021-11-06 21:57:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:57:15,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:57:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:57:49,945 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:57:49,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:57:49,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38566129] [2021-11-06 21:57:49,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38566129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:57:49,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:57:49,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 21:57:49,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687806938] [2021-11-06 21:57:49,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 21:57:49,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:57:49,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 21:57:49,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-11-06 21:57:49,947 INFO L87 Difference]: Start difference. First operand 28997 states and 36305 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 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:57:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:57:55,603 INFO L93 Difference]: Finished difference Result 32975 states and 41134 transitions. [2021-11-06 21:57:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 21:57:55,603 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2021-11-06 21:57:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:57:55,638 INFO L225 Difference]: With dead ends: 32975 [2021-11-06 21:57:55,638 INFO L226 Difference]: Without dead ends: 29005 [2021-11-06 21:57:55,651 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-11-06 21:57:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29005 states. [2021-11-06 21:57:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29005 to 28997. [2021-11-06 21:57:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28997 states, 28771 states have (on average 1.2617218727190573) internal successors, (36301), 28996 states have internal predecessors, (36301), 0 states have call successors, (0), 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:57:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28997 states to 28997 states and 36301 transitions. [2021-11-06 21:57:57,429 INFO L78 Accepts]: Start accepts. Automaton has 28997 states and 36301 transitions. Word has length 109 [2021-11-06 21:57:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:57:57,430 INFO L470 AbstractCegarLoop]: Abstraction has 28997 states and 36301 transitions. [2021-11-06 21:57:57,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 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:57:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 28997 states and 36301 transitions. [2021-11-06 21:57:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-06 21:57:57,431 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:57:57,431 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] [2021-11-06 21:57:57,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 21:57:57,432 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr249ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:57:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:57:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -594244124, now seen corresponding path program 1 times [2021-11-06 21:57:57,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:57:57,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683061626] [2021-11-06 21:57:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:57:57,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:57:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:57:57,928 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:57:57,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:57:57,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683061626] [2021-11-06 21:57:57,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683061626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:57:57,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:57:57,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:57:57,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034250855] [2021-11-06 21:57:57,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:57:57,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:57:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:57:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:57:57,929 INFO L87 Difference]: Start difference. First operand 28997 states and 36301 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:58:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:58:01,602 INFO L93 Difference]: Finished difference Result 52851 states and 66287 transitions. [2021-11-06 21:58:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:58:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2021-11-06 21:58:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:58:01,687 INFO L225 Difference]: With dead ends: 52851 [2021-11-06 21:58:01,687 INFO L226 Difference]: Without dead ends: 52843 [2021-11-06 21:58:01,707 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:58:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52843 states. [2021-11-06 21:58:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52843 to 28989. [2021-11-06 21:58:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28989 states, 28767 states have (on average 1.2613411200333715) internal successors, (36285), 28988 states have internal predecessors, (36285), 0 states have call successors, (0), 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:58:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28989 states to 28989 states and 36285 transitions. [2021-11-06 21:58:03,751 INFO L78 Accepts]: Start accepts. Automaton has 28989 states and 36285 transitions. Word has length 118 [2021-11-06 21:58:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:58:03,751 INFO L470 AbstractCegarLoop]: Abstraction has 28989 states and 36285 transitions. [2021-11-06 21:58:03,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:58:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 28989 states and 36285 transitions. [2021-11-06 21:58:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-06 21:58:03,752 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:58:03,753 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:58:03,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 21:58:03,753 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr250ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:58:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:58:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1964589364, now seen corresponding path program 1 times [2021-11-06 21:58:03,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:58:03,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609274944] [2021-11-06 21:58:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:58:03,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:58:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:58:04,157 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:58:04,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:58:04,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609274944] [2021-11-06 21:58:04,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609274944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:58:04,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:58:04,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:58:04,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108052013] [2021-11-06 21:58:04,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:58:04,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:58:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:58:04,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:58:04,159 INFO L87 Difference]: Start difference. First operand 28989 states and 36285 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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:58:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:58:10,145 INFO L93 Difference]: Finished difference Result 52985 states and 66427 transitions. [2021-11-06 21:58:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:58:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2021-11-06 21:58:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:58:10,222 INFO L225 Difference]: With dead ends: 52985 [2021-11-06 21:58:10,222 INFO L226 Difference]: Without dead ends: 52977 [2021-11-06 21:58:10,240 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:58:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52977 states. [2021-11-06 21:58:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52977 to 28981. [2021-11-06 21:58:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28981 states, 28763 states have (on average 1.260960261446998) internal successors, (36269), 28980 states have internal predecessors, (36269), 0 states have call successors, (0), 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:58:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28981 states to 28981 states and 36269 transitions. [2021-11-06 21:58:12,393 INFO L78 Accepts]: Start accepts. Automaton has 28981 states and 36269 transitions. Word has length 127 [2021-11-06 21:58:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:58:12,393 INFO L470 AbstractCegarLoop]: Abstraction has 28981 states and 36269 transitions. [2021-11-06 21:58:12,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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:58:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 28981 states and 36269 transitions. [2021-11-06 21:58:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-06 21:58:12,394 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:58:12,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:58:12,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 21:58:12,395 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:58:12,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:58:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1231423537, now seen corresponding path program 1 times [2021-11-06 21:58:12,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:58:12,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042206802] [2021-11-06 21:58:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:58:12,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:58:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:58:13,521 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:58:13,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:58:13,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042206802] [2021-11-06 21:58:13,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042206802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:58:13,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:58:13,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:58:13,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034521040] [2021-11-06 21:58:13,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:58:13,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:58:13,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:58:13,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:58:13,522 INFO L87 Difference]: Start difference. First operand 28981 states and 36269 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:58:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:58:20,336 INFO L93 Difference]: Finished difference Result 58326 states and 73434 transitions. [2021-11-06 21:58:20,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:58:20,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2021-11-06 21:58:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:58:20,385 INFO L225 Difference]: With dead ends: 58326 [2021-11-06 21:58:20,385 INFO L226 Difference]: Without dead ends: 29529 [2021-11-06 21:58:20,423 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:58:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29529 states. [2021-11-06 21:58:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29529 to 29529. [2021-11-06 21:58:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29529 states, 29311 states have (on average 1.2560813346525195) internal successors, (36817), 29528 states have internal predecessors, (36817), 0 states have call successors, (0), 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:58:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29529 states to 29529 states and 36817 transitions. [2021-11-06 21:58:22,589 INFO L78 Accepts]: Start accepts. Automaton has 29529 states and 36817 transitions. Word has length 132 [2021-11-06 21:58:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:58:22,590 INFO L470 AbstractCegarLoop]: Abstraction has 29529 states and 36817 transitions. [2021-11-06 21:58:22,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:58:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 29529 states and 36817 transitions. [2021-11-06 21:58:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-06 21:58:22,591 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:58:22,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:58:22,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 21:58:22,591 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 645 more)] === [2021-11-06 21:58:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:58:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 766647297, now seen corresponding path program 1 times [2021-11-06 21:58:22,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:58:22,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687826092] [2021-11-06 21:58:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:58:22,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:58:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:58:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:58:24,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:58:24,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687826092] [2021-11-06 21:58:24,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687826092] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:58:24,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038046075] [2021-11-06 21:58:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:58:24,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:58:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:58:24,141 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:58:24,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process Killed by 15